Abstract
Subspace clustering mines the clusters present in locally relevant subsets of the attributes. In the literature, several approaches have been suggested along with different measures for quality assessment. Pleiades provides the means for easy comparison and evaluation of different subspace clustering approaches, along with several quality measures specific for subspace clustering as well as extensibility to further application areas and algorithms. It extends the popular WEKA mining tools, allowing for contrasting results with existing algorithms and data sets. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Assent, I., Müller, E., Krieger, R., Jansen, T., & Seidl, T. (2008). Pleiades: Subspace clustering and evaluation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5212 LNAI, pp. 666–671). https://doi.org/10.1007/978-3-540-87481-2_44
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.