1301 search results - page 38 / 261 » Default Clustering from Sparse Data Sets |
130
click to vote
ICTAI
2006
IEEE
15 years 9 months ago
2006
IEEE
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorith...
126
click to vote
ECML
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we study the identification of sparse interaction networks as a machine learning problem. Sparsity means that we are provided with a small data set and a high number...
148
click to vote
BMCBI
2007
15 years 3 months ago
2007
Background: Gene expression measurements during the development of the fly Drosophila melanogaster are routinely used to find functional modules of temporally co-expressed genes. ...
144
click to vote
IIS
2004
15 years 5 months ago
2004
Search results clustering problem is defined as an automatic, on-line grouping of similar documents in a search hits list, returned from a search engine. In this paper we present t...
141
click to vote
WAIM
2007
Springer
15 years 10 months ago
2007
Springer
We propose DHCS, a method of distributed, hierarchical clustering and summarization for online data analysis and mining in sensor networks. Different from the acquisition and aggre...