ELKI: A Software System for Evaluation of Subspace Clustering Algorithms

@inproceedings{Achtert2008ELKIAS,
  title={ELKI: A Software System for Evaluation of Subspace Clustering Algorithms},
  author={Elke Achtert and H. Kriegel and A. Zimek},
  booktitle={SSDBM},
  year={2008}
}
  • Elke Achtert, H. Kriegel, A. Zimek
  • Published in SSDBM 2008
  • Computer Science
  • In order to establish consolidated standards in novel data mining areas, newly proposed algorithms need to be evaluated thoroughly. Many publications compare a new proposition --- if at all --- with one or two competitors or even with a so called "naive" ad hocsolution. For the prolific field of subspace clustering, we propose a software framework implementing many prominent algorithms and, thus, allowing for a fair and thorough evaluation. Furthermore, we describe how new algorithms for new… CONTINUE READING
    96 Citations
    An extension of the PMML standard to subspace clustering models
    • 5
    • Highly Influenced
    • PDF
    Subspace clustering for complex data
    • 2
    • PDF
    A Novel Approach for High Dimensional Data Clustering
    • 13
    • PDF
    Subspace and projected clustering: experimental evaluation and analysis
    • 70
    KDD-SC: Subspace Clustering Extensions for Knowledge Discovery Frameworks
    • Highly Influenced
    • PDF
    Finding and visualizing relevant subspaces for clustering high-dimensional astronomical data using connected morphological operators
    • 30
    • PDF

    References

    SHOWING 1-10 OF 36 REFERENCES
    Fast algorithms for projected clustering
    • 1,109
    • PDF
    Automatic subspace clustering of high dimensional data for data mining applications
    • 2,595
    • PDF
    OPTICS: ordering points to identify the clustering structure
    • 3,280
    • PDF
    Robust Clustering in Arbitrarily Oriented Subspaces
    • 27
    • PDF
    /spl delta/-clusters: capturing subspace correlation in a large data set
    • 362
    • PDF
    Finding generalized projected clusters in high dimensional spaces
    • 517
    • PDF
    Finding generalized projected clusters in high dimensional spaces
    • 226
    • PDF
    A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise
    • 15,294
    • PDF
    M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
    • 1,799
    • PDF
    Finding Hierarchies of Subspace Clusters
    • 59
    • PDF