Density Biased Sampling: An Improved Method for Data Mining and Clustering.

@inproceedings{DBLP:conf/sigmod/PalmerF00,
  author    = {Christopher R. Palmer and
               Christos Faloutsos},
  editor    = {Weidong Chen and
               Jeffrey F. Naughton and
               Philip A. Bernstein},
  title     = {Density Biased Sampling: An Improved Method for Data Mining and
               Clustering},
  booktitle = {Proceedings of the 2000 ACM SIGMOD International Conference on
               Management of Data, May 16-18, 2000, Dallas, Texas, USA},
  publisher = {ACM},
  year      = {2000},
  isbn      = {1-58113-218-2},
  pages     = {82-92},
  ee        = {http://doi.acm.org/10.1145/342009.335384, db/conf/sigmod/PalmerF00.html},
  crossref  = {DBLP:conf/sigmod/2000},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 2000 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

Online Edition

References

[1]

Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman: Compilers: Princiles, Techniques, and Tools. Addison-Wesley 1986, ISBN 0-201-10088-6

[2]

Paul S. Bradley, Usama M. Fayyad, Cory Reina: Scaling Clustering Algorithms to Large Databases. KDD 1998: 9-15

[3]

...

[4]

Chris Buckley, Mandar Mitra, Janet A. Walz, Claire Cardie: Using Clustering and SuperConcepts Within SMART: TREC 6. TREC 1997: 107-124

[5]

Christos Faloutsos, H. V. Jagadish: On B-Tree Indices for Skewed Distributions. VLDB 1992: 363-374

[6]

Christos Faloutsos, Yossi Matias, Abraham Silberschatz: Modeling Skewed Distribution Using Multifractals and the `80-20' Law. VLDB 1996: 307-317

[7]

Usama M. Fayyad, Cory Reina, Paul S. Bradley: Initialization of Iterative Refinement Clustering Algorithms. KDD 1998: 194-198

[8]

Phillip B. Gibbons, Yossi Matias: New Sampling-Based Summary Statistics for Improving Approximate Query Answers. SIGMOD Conference 1998: 331-342

[9]

Sudipto Guha, Rajeev Rastogi, Kyuseok Shim: CURE: An Efficient Clustering Algorithm for Large Databases. SIGMOD Conference 1998: 73-84

[10]

Peter J. Haas, Jeffrey F. Naughton, S. Seshadri, Lynne Stokes: Sampling-Based Estimation of the Number of Distinct Values of an Attribute. VLDB 1995: 311-322

[11]

...

[12]

Joseph M. Hellerstein, Peter J. Haas, Helen J. Wang: Online Aggregation. SIGMOD Conference 1997: 171-182

[13]

...

[14]

...

[15]

...

[16]

...

[17]

Frank Olken, Doron Rotem, Ping Xu: Random Sampling from Hash Files. SIGMOD Conference 1990: 375-386

[18]

Edie M. Rasmussen: Clustering Algorithms. Information Retrieval: Data Structures & Algorithms 1992: 419-442

[19]

...

[20]

Manfred Schroeder: Fractals, Chaos, Power Laws: Minutes From an Infinite Paradise. W. H. Freeman 1991

[21]

Jeffrey Scott Vitter: Random Sampling with a Reservoir. ACM Trans. Math. Softw. 11(1): 37-57(1985)

[22]

Oren Zamir, Oren Etzioni: Web Document Clustering: A Feasibility Demonstration. SIGIR 1998: 46-54

[23]

Tian Zhang, Raghu Ramakrishnan, Miron Livny: BIRCH: An Efficient Data Clustering Method for Very Large Databases. SIGMOD Conference 1996: 103-114

[24]

George Kingsley Zipf: Human Behaviour and the Principle of Least Effort: an Introduction to Human Ecology. Addison-Wesley 1949