Average parameterization and partial kernelization for computing medians

Journal of Computer and System Sciences

Volumn 77, Issue 4, 2011, Pages 774-789

  Betzler, Nadja ^a   Guo, Jiong ^b   Komusiewicz, Christian ^a   Niedermeier, Rolf ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

Consensus clustering; Data reduction; Fixed parameter tractability; Polynomial time preprocessing; Rank aggregation

Indexed keywords

CLUSTER ANALYSIS; DATA REDUCTION;

AVERAGE DISTANCE; CONSENSUS CLUSTERING; DEGREE OF SIMILARITY; FIXED-PARAMETER TRACTABILITY; METHODOLOGICAL FRAMEWORKS; POLYNOMIAL-TIME PREPROCESSINGS; RANK AGGREGATION; SOLVING ALGORITHM;

POLYNOMIAL APPROXIMATION;

EID: 78650858290     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2010.07.005     Document Type: Conference Paper

References (32)

1. N. Ailon Aggregation of partial rankings, p-ratings, and top-m lists Algorithmica 57 2 2010 284 300
2. N. Ailon, M. Charikar, and A. Newman Aggregating inconsistent information: ranking and clustering J. ACM 55 5 2008 Article 23, October 2008, 27 pages
3. A. Amir, Y. Aumann, G. Benson, A. Levy, O. Lipsky, E. Porat, S. Skiena, and U. Vishne Pattern matching with address errors: rearrangement distances J. Comput. System Sci. 75 6 2009 359 370
4. J. Bartholdi III, C.A. Tovey, and M.A. Trick Voting schemes for which it can be difficult to tell who won the election Soc. Choice Welf. 6 1989 157 165
5. M. Bertolacci, and A. Wirth Are approximation algorithms for consensus clustering worthwhile? Proceedings of the 7th SIAM International Conference on Data Mining (SDM 07) 2007 SIAM 437 442
6. N. Betzler, M.R. Fellows, J. Guo, R. Niedermeier, and F.A. Rosamond Fixed-parameter algorithms for Kemeny rankings Theoret. Comput. Sci. 410 45 2009 4554 4570
7. N. Betzler, R. Bredereck, R. Niedermeier, Partial kernelization for rank aggregation: theory and experiments, in: Proceedings of the 3rd International Workshop on Computational Social Choice (COMSOC 10), 2010, in press.
8. H.L. Bodlaender Kernelization: New upper and lower bound techniques Proceedings of the 4th International Workshop on Parameterized and Exact Computation (IWPEC 09) Lecture Notes in Comput. Sci. vol. 5917 2009 Springer 17 37
9. P. Bonizzoni, G.D. Vedova, R. Dondi, and T. Jiang On the approximation of correlation clustering and consensus clustering J. Comput. System Sci. 74 5 2008 671 696 (Pubitemid 351685699)
10. V. Conitzer Computing Slater rankings using similarities among candidates Proceedings of the 21st National Conference on Artificial Intelligence (AAAI 06) 2006 AAAI Press 613 619 (Pubitemid 44705351)
11. V. Conitzer, and T. Sandholm Common voting rules as maximum likelihood estimators Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence (UAI 05) 2005 AUAI Press 145 152
12. V. Conitzer, A. Davenport, and J. Kalagnanam Improved bounds for computing Kemeny rankings Proceedings of the 21st National Conference on Artificial Intelligence (AAAI 06) 2006 AAAI Press 620 626 (Pubitemid 44705352)
13. R.G. Downey, and M.R. Fellows Parameterized Complexity 1999 Springer
14. C. Dwork, R. Kumar, M. Naor, D. Sivakumar, Rank aggregation methods for the Web, in: Proceedings of the 10th International World Wide Web Conference (WWW 01), 2001, pp. 613-622.
15. M.R. Fellows Towards fully multivariate algorithmics: Some new results and directions in parameter ecology Proceedings of the 20th International Workshop on Combinatorial Algorithms (IWOCA 09) Lecture Notes in Comput. Sci. vol. 5874 2009 Springer 2 10
16. J. Flum, and M. Grohe Parameterized Complexity Theory 2006 Springer
17. A. Goder, and V. Filkov Consensus clustering algorithms: Comparison and refinement Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX 08) 2008 SIAM 109 117
18. J. Guo, and R. Niedermeier Invitation to data reduction and problem kernelization ACM SIGACT News 38 1 2007 31 45
19. E. Hemaspaandra, H. Spakowski, and J. Vogel The complexity of Kemeny elections Theoret. Comput. Sci. 349 2005 382 391 (Pubitemid 41653447)
20. J. Kemeny Mathematics without numbers Daedalus 88 1959 571 591
21. C. Kenyon-Mathieu, and W. Schudy How to rank with few errors Proceedings of the 39th ACM Symposium on Theory of Computing (STOC 07) 2007 ACM 95 103 (Pubitemid 47630725)
22. J. Kleinberg, and É. Tardos Algorithm Design 2006 Addison Wesley
23. M. Křivánek, and J. Morávek NP-hard problems in hierarchical-tree clustering Acta Inform. 23 3 1986 311 323
24. D. Marx Closest substring problems with small distances SIAM J. Comput. 38 4 2008 1382 1410
25. S. Monti, P. Tamayo, J.P. Mesirov, and T.R. Golub Consensus clustering: A resampling-based method for class discovery and visualization of gene expression microarray data Mach. Learn. 52 1-2 2003 91 118
26. R. Niedermeier Invitation to Fixed-Parameter Algorithms 2006 Oxford University Press
27. R. Niedermeier Reflections on multivariate algorithmics and problem parameterization Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS 10) LIPIcs vol. 5 2010 Schloss Dagstuhl/Leibniz-Zentrum für Informatik 17 32
28. V.Y. Popov Multiple genome rearrangement by swaps and by element duplications Theoret. Comput. Sci. 385 1-3 2007 115 126 (Pubitemid 47419160)
29. F. Schalekamp, and A. van Zuylen Rank aggregation: together we re strong Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX 09) 2009 SIAM 38 51
30. N. Simjour Improved parameterized algorithms for the Kemeny aggregation problem Proceedings of the 4th International Workshop on Parameterized and Exact Computation (IWPEC 09) Lecture Notes in Comput. Sci. vol. 5917 2009 Springer 312 323
31. Y. Wakabayashi The complexity of computing medians of relations Resenhas 3 3 1998 323 350
32. A. van Zuylen, and D.P. Williamson Deterministic pivoting algorithms for constrained ranking and clustering problems Math. Oper. Res. 34 2009 594 620