4791 search results - page 306 / 959 » Clustering with partial information |
173
click to vote
IPPS
2005
IEEE
16 years 11 days ago
2005
IEEE
We develop a message scheduling scheme that can theoretically achieve the maximum throughput for all–to–all personalized communication (AAPC) on any given Ethernet switched cl...
146
click to vote
PAKDD
2004
ACM
16 years 4 days ago
2004
ACM
Abstract. Traditional clustering algorithms are based on one representation space, usually a vector space. However, in a variety of modern applications, multiple representations ex...
159
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
Node-link diagrams are widely used in information visualization to show relationships among data. However, when the size of data becomes very large, node-link diagrams will become ...
165
click to vote
AAAI
2008
15 years 9 months ago
2008
Complex graphs, in which multi-type nodes are linked to each other, frequently arise in many important applications, such as Web mining, information retrieval, bioinformatics, and...
184
click to vote
DBISP2P
2008
Springer
15 years 8 months ago
2008
Springer
K-Means clustering is widely used in information retrieval and data mining. Distributed K-Means variants have already been proposed, but none of the past algorithms scales to large...