Programmable clustering

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2006, Pages 348-354

  Gollapudi, Sreenivas ^a   Kumar, Ravi ^b   Sivakumar, D ^c  

^a Ebrary Inc   (United States)

^b YAHOO RESEARCH   (United States)

^c GOOGLE INC   (United States)

Author keywords

Clustering; First order formula

Indexed keywords

CLUSTERING; CLUSTERING PROBLEMS; FIRST-ORDER FORMULA;

ALGORITHMS; CLUSTER ANALYSIS; DATA REDUCTION; OPTIMIZATION; USER INTERFACES;

COMPUTER PROGRAMMING;

EID: 34250683850     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1142351.1142400     Document Type: Conference Paper

References (7)

1. N. Ailon, M. Charikar, and A. Newman. Aggregating consistent information: Ranking and clustering. In Proceedings of the 87th Annual ACM Symposium on Theory of Computing, pages 684-693, 2005.
2. R. O. Duda, P. E. Hart, and D. G. Stork. Pattern Classification. Wiley Interscience, 2000.
3. R. Fagin. Generalized first-order spectra and polynomial-time recognizable sets. In R. Karp, editor, Complexity of COmputation, SIAM-AMS Proceedings 7, pages 43-73, 1974.
4. A. Gionis, H. Mannila, and P. Tsaparas. Clustering aggregation. In Proceedings of the 21st International Conference on Data Engineering, pages 341-352, 2005.
5. N. Immerman. Descriptive Complexity. Springer, 1998.
6. N. Jardine and R. Sibson. Mathematical Taxonomy. Wiley, 1971.
7. J. Kleinberg. An impossibility theorem for clustering. In Advances in Neural Information Processing Systems 15, pages 446-453, 2002.