ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

Constraint-based clustering in large databases.

Anthony K. H. Tung, Raymond T. Ng, Laks V. S. Lakshmanan, Jiawei Han: Constraint-based clustering in large databases. ICDT 2001: 405-419
@inproceedings{DBLP:conf/icdt/KungNLH01,
  author    = {Anthony K. H. Tung and
               Raymond T. Ng and
               Laks V. S. Lakshmanan and
               Jiawei Han},
  editor    = {Jan Van den Bussche and
               Victor Vianu},
  title     = {Constraint-based clustering in large databases},
  booktitle = {Database Theory - ICDT 2001, 8th International Conference, London,
               UK, January 4-6, 2001, Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1973},
  year      = {2001},
  isbn      = {3-540-41456-8},
  pages     = {405-419},
  ee        = {db/conf/icdt/KungNLH01.html, http://link.springer.de/link/service/series/0558/bibs/1973/19730405.htm},
  crossref  = {DBLP:conf/icdt/2001},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
BibTeX

Online Edition: Springer LINK

Citation Page BibTeX

References

[AGGR98]
Rakesh Agrawal, Johannes Gehrke, Dimitrios Gunopulos, Prabhakar Raghavan: Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications. SIGMOD Conference 1998: 94-105 BibTeX
[BBD00]
...
[BFR98]
Paul S. Bradley, Usama M. Fayyad, Cory Reina: Scaling Clustering Algorithms to Large Databases. KDD 1998: 9-15 BibTeX
[EKSX96]
Martin Ester, Hans-Peter Kriegel, Jörg Sander, Xiaowei Xu: A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. KDD 1996: 226-231 BibTeX
[GJ79]
M. R. Garey, David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 1979, ISBN 0-7167-1044-7
BibTeX
[HaKa00]
Jiawei Han, Micheline Kamber: Data Mining: Concepts and Techniques. Morgan Kaufmann 2000, ISBN 1-55860-489-8
BibTeX
[KHK99]
George Karypis, Eui-Hong Han, Vipin Kumar: Chameleon: Hierarchical Clustering Using Dynamic Modeling. IEEE Computer 32(8): 68-75(1999) BibTeX
[KMR97]
David R. Karger, Rajeev Motwani, G. D. S. Ramkumar: On Approximating the Longest Path in a Graph. Algorithmica 18(1): 82-98(1997) BibTeX
[KPR98]
Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan: A Microeconomic View of Data Mining. Data Min. Knowl. Discov. 2(4): 311-324(1998) BibTeX
[KR90]
L. Kaufman, P. J. Rousseeuw: Finding Groups in Data: An Introduction to Cluster Analysis. John Wiley 1990
BibTeX
[LNHP99]
Laks V. S. Lakshmanan, Raymond T. Ng, Jiawei Han, Alex Pang: Optimization of Constrained Frequent Set Queries with 2-variable Constraints. SIGMOD Conference 1999: 157-168 BibTeX
[NH94]
Raymond T. Ng, Jiawei Han: Efficient and Effective Clustering Methods for Spatial Data Mining. VLDB 1994: 144-155 BibTeX
[NLHP98]
Raymond T. Ng, Laks V. S. Lakshmanan, Jiawei Han, Alex Pang: Exploratory Mining and Pruning Optimizations of Constrained Association Rules. SIGMOD Conference 1998: 13-24 BibTeX
[STA97]
David B. Shmoys, Éva Tardos, Karen Aardal: Approximation Algorithms for Facility Location Problems (Extended Abstract). STOC 1997: 265-274 BibTeX
[TNLH00]
...
[WYM97]
Wei Wang, Jiong Yang, Richard R. Muntz: STING: A Statistical Information Grid Approach to Spatial Data Mining. VLDB 1997: 186-195 BibTeX
[ZRL96]
Tian Zhang, Raghu Ramakrishnan, Miron Livny: BIRCH: An Efficient Data Clustering Method for Very Large Databases. SIGMOD Conference 1996: 103-114 BibTeX
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
Lecture Notes in Computer Science: Copyright © by Springer
Digitization of EDBT/ICDT/MFDBS proceedings was supported by the EDBT Endowment.
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:19:18 2009