Sciweavers

1301 search results - page 27 / 261
» Default Clustering from Sparse Data Sets
Sort
View
ASUNAM
2009
IEEE
15 years 9 months ago
Mining the Dynamics of Music Preferences from a Social Networking Site
In this paper we present an application of our incremental graph clustering algorithm (DENGRAPH) on a data set obtained from the music community site Last.fm. The aim of our study...
Nico Schlitter, Tanja Falkowski
ICDE
2010
IEEE
273views Database» more  ICDE 2010»
16 years 3 months ago
WikiAnalytics: Ad-hoc Querying of Highly Heterogeneous Structured Data
Searching and extracting meaningful information out of highly heterogeneous datasets is a hot topic that received a lot of attention. However, the existing solutions are based on e...
Andrey Balmin, Emiran Curtmola
BMCBI
2006
164views more  BMCBI 2006»
15 years 3 months ago
Evaluation of clustering algorithms for gene expression data
Background: Cluster analysis is an integral part of high dimensional data analysis. In the context of large scale gene expression data, a filtered set of genes are grouped togethe...
Susmita Datta, Somnath Datta
116
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Dictionary learning of convolved signals
Assuming that a set of source signals is sparsely representable in a given dictionary, we show how their sparse recovery fails whenever we can only measure a convolved observation...
Daniele Barchiesi, Mark D. Plumbley
AIRS
2006
Springer
15 years 7 months ago
Natural Document Clustering by Clique Percolation in Random Graphs
Document clustering techniques mostly depend on models that impose explicit and/or implicit priori assumptions as to the number, size, disjunction characteristics of clusters, and/...
Wei Gao, Kam-Fai Wong