메뉴 건너뛰기




Volumn 34, Issue 3, 2009, Pages 594-620

Deterministic pivoting algorithms for constrained ranking and clustering problems

Author keywords

Approximation algorithm; Consensus clustering; Correlation clustering; Derandomization; Hierarchical clustering; Minimum feedback arc set in tournaments; Rank aggregation

Indexed keywords

CONSENSUS CLUSTERING; CORRELATION CLUSTERING; DERANDOMIZATION; HIERARCHICAL CLUSTERING; MINIMUM FEEDBACK ARC SET IN TOURNAMENTS; RANK AGGREGATION;

EID: 70349272838     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1090.0385     Document Type: Article
Times cited : (99)

References (35)
  • 4
    • 56349095491 scopus 로고    scopus 로고
    • Aggregating inconsistent information: Ranking and clustering
    • Ailon, N., M. Charikar, A. Newman. 2008. Aggregating inconsistent information: Ranking and clustering. J. ACM 55(5) 1-27.
    • (2008) J. ACM , vol.55 , Issue.5 , pp. 1-27
    • Ailon, N.1    Charikar, M.2    Newman, A.3
  • 5
    • 33746043842 scopus 로고    scopus 로고
    • Ranking tournaments
    • Alon, N. 2006. Ranking tournaments. SIAM J. Discret. Math. 20(1) 137-142.
    • (2006) SIAM J. Discret. Math. , vol.20 , Issue.1 , pp. 137-142
    • Alon, N.1
  • 9
    • 36948999941 scopus 로고    scopus 로고
    • School of Information and Computer Science, University of California, Irvine
    • Asuncion, A., D. J. Newman. 2007. UCI machine learning repository. School of Information and Computer Science, University of California, Irvine. http://www.ics.uci.edu/-mlearn/MLRepository.htm.
    • (2007) UCI Machine Learning Repository
    • Asuncion, A.1    Newman, D.J.2
  • 10
  • 11
    • 0012257673 scopus 로고
    • Voting schemes for which it can be difficult to tell who won the election
    • Bartholdi, J. J., C. A. Tovey, M. A. Trick. 1989. Voting schemes for which it can be difficult to tell who won the election. Soc. Choice Welfare 6 157-165.
    • (1989) Soc. Choice Welfare , vol.6 , pp. 157-165
    • Bartholdi, J.J.1    Tovey, C.A.2    Trick, M.A.3
  • 12
    • 33845516925 scopus 로고    scopus 로고
    • The minimum feedback arc set problem is NP-hard for tournaments
    • Charbit, P., S. Thomassé, A. Yeo. 2007. The minimum feedback arc set problem is NP-hard for tournaments. Combin. Probab. Comput. 16(1) 1-4.
    • (2007) Combin. Probab. Comput. , vol.16 , Issue.1 , pp. 1-4
    • Charbit, P.1    Thomassé, S.2    Yeo, A.3
  • 17
    • 0003311437 scopus 로고
    • Probabilistic methods in combinatorics
    • Academic Press [subsidiary of Harcourt Brace Jovanovich Publishers], New York and London
    • Erdos, P., J. Spencer. 1974. Probabilistic methods in combinatorics. Probability and Mathematical Statistics, Vol.17. Academic Press [subsidiary of Harcourt Brace Jovanovich Publishers], New York and London.
    • (1974) Probability and Mathematical Statistics , vol.17
    • Erdos, P.1    Spencer, J.2
  • 18
    • 0000255727 scopus 로고    scopus 로고
    • Approximating minimum feedback sets and multicuts in directed graphs
    • Even, G., J. Naor, B. Schieber, M. Sudan. 1998. Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica 20(2) 151-174.
    • (1998) Algorithmica , vol.20 , Issue.2 , pp. 151-174
    • Even, G.1    Naor, J.2    Schieber, B.3    Sudan, M.4
  • 21
    • 0040942625 scopus 로고    scopus 로고
    • Quick approximation to matrices and applications
    • Frieze, A. M., R. Kannan. 1999. Quick approximation to matrices and applications. Combinatorica 19(2) 175-220.
    • (1999) Combinatorica , vol.19 , Issue.2 , pp. 175-220
    • Frieze, A.M.1    Kannan, R.2
  • 25
    • 70349292476 scopus 로고    scopus 로고
    • Hegde, R., K. Jain. Personal communication
    • Hegde, R., K. Jain. Personal communication.
  • 27
    • 0001450923 scopus 로고
    • Mathematics without numbers
    • Kemeny, J. G. 1959. Mathematics without numbers. Daedalus 88 575-591.
    • (1959) Daedalus , vol.88 , pp. 575-591
    • Kemeny, J.G.1
  • 29
    • 0022735230 scopus 로고
    • NP-hard problems in hierarchical-tree clustering
    • Křivánek, M., J. Morávek. 1986. NP-hard problems in hierarchical-tree clustering. Acta Inform. 23(3) 311-323.
    • (1986) Acta Inform. , vol.23 , Issue.3 , pp. 311-323
    • Křivánek, M.1    Morávek, J.2
  • 30
    • 0042312608 scopus 로고    scopus 로고
    • Feature weighting in k-means clustering
    • Modha, D., S. Spangler. 2003. Feature weighting in k-means clustering. Machine Learn. 52(3) 217-237.
    • (2003) Machine Learn. , vol.52 , Issue.3 , pp. 217-237
    • Modha, D.1    Spangler, S.2
  • 32
    • 34249756824 scopus 로고
    • Packing directed circuits fractionally
    • Seymour, P. D. 1995. Packing directed circuits fractionally. Combinatorica 15(2) 281-288.
    • (1995) Combinatorica , vol.15 , Issue.2 , pp. 281-288
    • Seymour, P.D.1
  • 33
    • 0345007607 scopus 로고    scopus 로고
    • The complexity of computing medians of relations
    • Wakabayashi, Y. 1998. The complexity of computing medians of relations. Resenhas 3(3) 323-349.
    • (1998) Resenhas , vol.3 , Issue.3 , pp. 323-349
    • Wakabayashi, Y.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.