A multi-criteria decision method based on rank distance

Fundamenta Informaticae

Volumn 86, Issue 1-2, 2008, Pages 79-91

  Dinu, Liviu P ^a   Popescu, Marius ^a  

^a UNIVERSITY OF BUCHAREST   (Romania)

Author keywords

Multi criteria decision; Rank aggregation problem; Rank distance

Indexed keywords

C (PROGRAMMING LANGUAGE); CLASSIFIERS; DECISION MAKING;

COMBINING METHOD; COMPUTATIONAL PROPERTIES; HANDWRITTEN NUMERAL; MULTI CRITERIA DECISION MAKING; MULTI-CRITERIA DECISION METHODS; MULTICRITERIA DECISION; RANK AGGREGATION; RANK DISTANCE;

STATISTICAL TESTS;

EID: 55849126742     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. K. J. Arrow. Social Choice andIndivudual Values, 2nd ed., New York, Wiley, 1963.
2. C. de la Higuera, F. Casacuberta. Topology of strings: Median string is NP- complete, Theor. Comp. Sci., 230, 39-48, 2000.
3. P. Diaconis. Group Representation in Probability and Statistics, IMS Lecture Series 11, IMS, 1988.
4. P. Diaconis and R.L. Graham. Spearman footrule as a measure of disarray, Journal of Royal Statistical Society. Series B (Methodological), Vol. 39, No. 2, 262-268, 1977.
5. L.P. Dinu. On the classification and aggregation of hierarchies with different constitutive elements, Fundamenta Informaticae, 55(1), 39-50, 2003.
6. L. P. Dinu, A. Dinu. On the syllabic similarities of Romance languages. In A. Gelbukh (Ed.): CICLing 2005, LNCS 3406, 785-788, 2005.
7. L.P.Dinu, F. Manea. An efficient approach for computing median rankings, Theoretical Computer Science, vol 359 (1-3), pp. 455-461, 2006.
8. L.P. Dinu, A. Sgarro. A low-complexity distance for DNA strings, Fundamenta Informaticae, 73(3), 361-372, 2006.
9. R.P. W. Duin, PRTools 3.0, A Matlab Toolbox for Pattern Recognition, Delft University of Technology, 2000.
10. R.P.W. Duin, David M.J. Tax. Experiments with Classifier Combining Rules. In J. Kittler and F. Roli (Eds.): MCS 2000, LNCS 1857, pp. 16-29, 2000.
11. C. Dwork, R. Kumar, M. Naor, and D. Sivakumar. Rank aggregation methods for the web, Proc. of the 10th International WWW Conference, 613-622, 2001.
12. K. Fukuda, T. Matsui. Finding all minimum cost perfect matchings in bipartite graphs, Networks, 22, 461-468, 1992.
13. T.K. Ho, J. Hull and S. Srihari. Decision Combination in Multiple Classifier Systems, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, no 1, pp. 66-75, 1994.
14. A.K. Jain, R.P.W. Duin, and J. Mao, Statistical Pattern Recognition: A Review, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, no. 1, 4-37, 2000.
15. J. Kittler, M. Hatef, R.P.W. Duin, and J. Matas, On Combining Classifiers, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 20, no. 3, 226-239, 1998.
16. C.-L. Liu. Classifier combination basedon confidence transformation, Pattern Recognition 38, 11-28, 2005.
17. F. Manea, C. Ploscaru. Solving a combinatorial problem with network flows, J. of Appl. Math, and Comp., 17(1-2), 391-399, 2005.
18. F. Manea, C. Ploscaru. A generalization of the Assignment Problem, and its application to the Rank Aggregation Problem, Fundamenta Informaticae, 81(4) (2007), 459-471.
19. S. Marcus. Linguistic structures and generative devices in molecular genetics, Cahiers Ling. Theor. Appl., 11, 77-104, 1974.
20. F. Nicolas, E. Rivals, Hardness Results for the Center and Median String Problems under the Weighted and Unweighted Edit Distances, J. of Discrete Algorithms, 3(2-4), 390-415, 2005.
21. http://rankd.info.