Sciweavers

2600 search results - page 1 / 520
» Clustering with or without the Approximation
Sort
View
COCOON
2010
Springer
14 years 3 months ago
Clustering with or without the Approximation
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
Frans Schalekamp, Michael Yu, Anke van Zuylen
IPMI
2009
Springer
14 years 5 months ago
Exploratory fMRI Analysis without Spatial Normalization
Abstract. We present an exploratory method for simultaneous parcellation of multisubject fMRI data into functionally coherent areas. The method is based on a solely functional repr...
Danial Lashkari, Polina Golland
ICDE
2008
IEEE
124views Database» more  ICDE 2008»
15 years 3 days ago
Mining Approximate Order Preserving Clusters in the Presence of Noise
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
Mengsheng Zhang, Wei Wang 0010, Jinze Liu
PAKDD
2005
ACM
112views Data Mining» more  PAKDD 2005»
14 years 4 months ago
Approximated Clustering of Distributed High-Dimensional Data
In many modern application ranges high-dimensional feature vectors are used to model complex real-world objects. Often these objects reside on different local sites. In this paper,...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
WEA
2005
Springer
107views Algorithms» more  WEA 2005»
14 years 4 months ago
Local Clustering of Large Graphs by Approximate Fiedler Vectors
Vectors [Extended Abstract] Pekka Orponen and Satu Elisa Schaeffer Laboratory for Theoretical Computer Science, P.O. Box 5400 FI-02015 TKK Helsinki University of Technology, Finlan...
Pekka Orponen, Satu Elisa Schaeffer