Sciweavers

502 search results - page 75 / 101
» Sparse Subspace Clustering
Sort
View
GSN
2009
Springer
149views Sensor Networks» more  GSN 2009»
15 years 4 months ago
Spatially-Localized Compressed Sensing and Routing in Multi-hop Sensor Networks
We propose energy-efficient compressed sensing for wireless sensor networks using spatially-localized sparse projections. To keep the transmission cost for each measurement low, we...
Sungwon Lee, Sundeep Pattem, Maheswaran Sathiamoor...
AAAI
2000
15 years 1 months ago
Unsupervised Learning and Interactive Jazz/Blues Improvisation
We present a new domain for unsupervised learning: automatically customizing the computer to a specific melodic performer by merely listening to them improvise. We also describe B...
Belinda Thom
GECCO
2008
Springer
250views Optimization» more  GECCO 2008»
15 years 27 days ago
Community detection in social networks with genetic algorithms
A new genetic algorithm to detect communities in social networks is presented. The algorithm uses a fitness function able to identify groups of nodes in the network having dense ...
Clara Pizzuti
COMPUTING
2007
103views more  COMPUTING 2007»
14 years 11 months ago
An algebraic approach for H-matrix preconditioners
Hierarchical matrices (H-matrices) approximate matrices in a data-sparse way, and the approximate arithmetic for H-matrices is almost optimal. In this paper we present an algebrai...
S. Oliveira, F. Yang
ICDM
2008
IEEE
184views Data Mining» more  ICDM 2008»
15 years 6 months ago
Bayesian Co-clustering
In recent years, co-clustering has emerged as a powerful data mining tool that can analyze dyadic data connecting two entities. However, almost all existing co-clustering techniqu...
Hanhuai Shan, Arindam Banerjee