The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Automatic subspace clustering of high dimensional data for data mining applications
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
OPTICS: ordering points to identify the clustering structure
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Fast algorithms for projected clustering
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Finding generalized projected clusters in high dimensional spaces
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Clustering by pattern similarity in large data sets
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
An Index Structure for Efficient Reverse Nearest Neighbor Queries
Proceedings of the 17th International Conference on Data Engineering
Biclustering of Expression Data
Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Generalized Search Trees for Database Systems
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
d-Clusters: Capturing Subspace Correlation in a Large Data Set
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Computing Clusters of Correlation Connected objects
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
YALE: rapid prototyping for complex data mining tasks
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Mining Hierarchies of Correlation Clusters
SSDBM '06 Proceedings of the 18th International Conference on Scientific and Statistical Database Management
Approximate reverse k-nearest neighbor queries in general metric spaces
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)
On Exploring Complex Relationships of Correlation Clusters
SSDBM '07 Proceedings of the 19th International Conference on Scientific and Statistical Database Management
A General Framework for Increasing the Robustness of PCA-Based Correlation Clustering Algorithms
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Detection and visualization of subspace cluster hierarchies
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Finding hierarchies of subspace clusters
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Outlier Detection in Axis-Parallel Subspaces of High Dimensional Data
PAKDD '09 Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
ELKI in Time: ELKI 0.2 for the Performance Evaluation of Distance Measures for Time Series
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Subspace and projected clustering: experimental evaluation and analysis
Knowledge and Information Systems
An extension of the PMML standard to subspace clustering models
Proceedings of the 2011 workshop on Predictive markup language modeling
Spatial outlier detection: data, algorithms, visualizations
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Visual evaluation of outlier detection models
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
An architecture for component-based design of representative-based clustering algorithms
Data & Knowledge Engineering
A space-based generic pattern for self-initiative load clustering agents
COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages
Machine Learning
| Hi-index | 0.00 |
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 "naïve" 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 applications can be incorporated in the framework easily.