Sciweavers

766 search results - page 18 / 154
» Clustering high dimensional data using subspace and projecte...
Sort
View
ICML
2010
IEEE
13 years 7 months ago
Multiple Non-Redundant Spectral Clustering Views
Many clustering algorithms only find one clustering solution. However, data can often be grouped and interpreted in many different ways. This is particularly true in the high-dim...
Donglin Niu, Jennifer G. Dy, Michael I. Jordan
WAIM
2005
Springer
14 years 2 months ago
Research Paper Recommender Systems: A Subspace Clustering Approach
Researchers from the same lab often spend a considerable amount of time searching for published articles relevant to their current project. Despite having similar interests, they c...
Nitin Agarwal, Ehtesham Haque, Huan Liu, Lance Par...
ICDE
2012
IEEE
246views Database» more  ICDE 2012»
11 years 11 months ago
HiCS: High Contrast Subspaces for Density-Based Outlier Ranking
—Outlier mining is a major task in data analysis. Outliers are objects that highly deviate from regular objects in their local neighborhood. Density-based outlier ranking methods...
Fabian Keller, Emmanuel Müller, Klemens B&oum...
SIGMOD
2000
ACM
212views Database» more  SIGMOD 2000»
14 years 1 months ago
SQLEM: Fast Clustering in SQL using the EM Algorithm
Clustering is one of the most important tasks performed in Data Mining applications. This paper presents an e cient SQL implementation of the EM algorithm to perform clustering in...
Carlos Ordonez, Paul Cereghini
KDD
2003
ACM
195views Data Mining» more  KDD 2003»
14 years 9 months ago
Visualizing changes in the structure of data for exploratory feature selection
Using visualization techniques to explore and understand high-dimensional data is an efficient way to combine human intelligence with the immense brute force computation power ava...
Elias Pampalk, Werner Goebl, Gerhard Widmer