Clustering Data Without Distance Functions.

G. D. Ramkumar, Arun N. Swami: Clustering Data Without Distance Functions. IEEE Data Eng. Bull. 21(1): 9-14(1998)

@article{DBLP:journals/debu/RamkumarS98,
  author    = {G. D. Ramkumar and
               Arun N. Swami},
  title     = {Clustering Data Without Distance Functions},
  journal   = {IEEE Data Eng. Bull.},
  volume    = {21},
  number    = {1},
  year      = {1998},
  pages     = {9-14},
  ee        = {db/journals/debu/RamkumarS98.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Data mining is being applied with profit in many applications. Clustering or segmentation of data is an important data mining application. One of the problems with traditional clustering methods is that they require the analyst to define distance functions that are not always available. In this paper, we describe a new method for clustering without distance functions.

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 2, SIGMOD '75-'92" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the CD and click on the path of your mount point:
/Anthology/smod7592 or /cdrom

DVD Version: Load ACM SIGMOD Anthology DVD 2" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the DVD and click on the path of your mount point:
/Anthology/aDVD2 or /dvd

Online Edition:

Data Engineering Bulletin March 1998: Mining of Large Datasets (Daniel Barbara, ed.)
( letter+figures , letter-figures , A4+figures , A4-figures , PDF+figures)

References

[1]: Rakesh Agrawal, Tomasz Imielinski, Arun N. Swami: Mining Association Rules between Sets of Items in Large Databases. SIGMOD Conference 1993: 207-216
[2]: Rakesh Agrawal, Ramakrishnan Srikant: Fast Algorithms for Mining Association Rules in Large Databases. VLDB 1994: 487-499
[3]: Eui-Hong Han, George Karypis, Vipin Kumar, Bamshad Mobasher: Clustering Based On Association Rule Hypergraphs. DMKD 1997: 0-
[4]: ...
[5]: Rajeev Motwani, Prabhakar Raghavan: Randomized Algorithms. Cambridge University Press 1995, ISBN 0-521-47465-5
[6]: Raymond T. Ng, Jiawei Han: Efficient and Effective Clustering Methods for Spatial Data Mining. VLDB 1994: 144-155
[7]: J. Ross Quinlan: C4.5: Programs for Machine Learning. Morgan Kaufmann 1993, ISBN 1-55860-238-0
[8]: Tian Zhang, Raghu Ramakrishnan, Miron Livny: BIRCH: An Efficient Data Clustering Method for Very Large Databases. SIGMOD Conference 1996: 103-114
[9]: Douglas H. Fisher: Improving Inference through Conceptual Clustering. AAAI 1987: 461-465
[10]: Douglas Fisher: Optimization and Simplification of Hierarchical Clusterings. KDD 1995: 118-123
[11]: ...