298 search results - page 37 / 60 » Subspace Clustering of High Dimensional Data |
140
click to vote
ICDM
2008
IEEE
15 years 10 months ago
2008
IEEE
We present a new visualization of the distance and cluster structure of high dimensional data. It is particularly well suited for analysis tasks of users unfamiliar with complex d...
131
click to vote
SIGIR
2003
ACM
15 years 9 months ago
2003
ACM
Most existing clustering algorithms cluster highly related data objects such as Web pages and Web users separately. The interrelation among different types of data objects is eith...
123
click to vote
ICDM
2003
IEEE
15 years 9 months ago
2003
IEEE
We explore in this paper the efficient clustering of item data. Different from those of the traditional data, the features of item data are known to be of high dimensionality and...
168
click to vote
ICDE
2012
IEEE
13 years 6 months ago
2012
IEEE
—Traditional clustering algorithms identify just a single clustering of the data. Today’s complex data, however, allow multiple interpretations leading to several valid groupin...
124
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
A large family of algorithms for dimensionality reduction end with solving a Trace Ratio problem in the form of arg maxW Tr(WT SpW)/Tr(WT SlW)1 , which is generally transformed in...