Clustering with lower bound on similarity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5476 LNAI, Issue , 2009, Pages 122-133

  Hasan, Mohammad Al ^a   Salem, Saeed ^a   Pupacdi, Benjarath ^b   Zaki, Mohammed J ^a  

^a Rensselaer Polytechnic Institute   (United States)

^b CHULABHORN RESEARCH INSTITUTE   (Thailand)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION BOUNDS; CLUSTERING QUALITY; LOWER BOUNDS; NUMBER OF CLUSTERS; ON-LINE SETTING; REPRESENTATIVE OBJECT; SYNTHETIC DATASETS;

CONTROL THEORY; MINING;

APPROXIMATION ALGORITHMS;

EID: 67650697693     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-01307-2_14     Document Type: Conference Paper

References (11)

1. Aggarwal, C.C., Han, J., Wang, J., Yu, P.S.: A framework for clustering evolving data streams. In: VLDB Proceedings (August 2003)
2. Aslam, J., Pelekhov, J.E., Rus, D.: The star clustering algorithm for static and dynamic information organization. Graph Algorithms and Application 8(1), 95-129 (2004) (Pubitemid 39282735)
3. Azoury, K.S., Warmuth, M.K.: Relative loss bounds for on-line density estimation with the exponential family of distributions.Machine Learning 43(3), 211-246 (2001)
4. Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data streams. In: ACM SIGMOD-SIGACT-SIGART symposium on Principles of Database Systems. ACM, New York
5. Banerjee, A., Basu, S.: Topic models over text streams: A study of batch and online unsepervised learning. In: SIAM Data Mining (2007)
6. Gil-Garćia, R.J., Bad́ia-Contelles, J.M., Pons-Porrata, A.: Extended Star Clustering. In: Sanfeliu, A., Ruiz-Shulcloper, J. (eds.) CIARP 2003. LNCS, vol.2905, pp. 480-487. Springer, Heidelberg (2003)
7. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
8. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979) 8. King, G., Tzeng, W.: On-line algorithm for the dominating set problem. Information Processing Letters 61, 11-14 (1997) (Pubitemid 127412014)
9. Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. Journal of the ACM 41(5), 960-981 (1994)
10. Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg
11. Zuckerman, D.: Np-complete problems have a version that's hard to approximate. In: Proc. of Eighth Annual Structure in Complexity Theorey, pp. 305-312. IEEE Computer Society, Los Alamitos (1993) (Pubitemid 23688384)