ACM Transactions on Knowledge Discovery from Data · 2008 · 39 citations · 28 references
ComputingComputer ScienceData ScienceData MiningMachine LearningStatistical LearningDimensionality AssessmentDimensionality ReductionDocument ClusteringOptimization For Machine LearningSemi-supervised LearningUnsupervised LearningBenchmark DatasetsClusteringConstraintsCriteria Of ValidityHigh-dimensional Data ClusteringSemi-supervised ClusteringSubspace ClusteringValidity Assessment
Clustering, as an unsupervised learning process is a challenging problem, especially in cases of high-dimensional datasets. Clustering result quality can benefit from user constraints and objective validity assessment. In this article, we propose a semisupervised framework for learning the weighted Euclidean subspace, where the best clustering can be achieved. Our approach capitalizes on: (i) user constraints; and (ii) the quality of intermediate clustering results in terms of their structural properties. The proposed framework uses the clustering algorithm and the validity measure as its parameters. We develop and discuss algorithms for learning and tuning the weights of contributing dimensions and defining the “best” clustering obtained by satisfying user constraints. Experimental results on benchmark datasets demonstrate the superiority of the proposed approach in terms of improved clustering accuracy.
28
Numerical recipes in C: the art of scientific computing
Choice Reviews Online · 1993 · 18.1K citations · Full text
Lawrence J. Hubert, Phipps Arabie · Journal of Classification · 1985 · 7.7K citations
Combining labeled and unlabeled data with co-training
Avrim Blum, Tom M. Mitchell · 1998 · 5.6K citations · Full text