138 search results - page 9 / 28 » Approximated Clustering of Distributed High-Dimensional Data |
TKDE
2012
11 years 10 months ago
2012
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
PR
2008
13 years 7 months ago
2008
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
ESANN
2006
13 years 9 months ago
2006
The Self-Organizing map (SOM), a powerful method for data mining and cluster extraction, is very useful for processing data of high dimensionality and complexity. Visualization met...
CSDA
2006
13 years 7 months ago
2006
An approach to simultaneous document classification and word clustering is developed using a two-way mixture model of Poisson distributions. Each document is represented by a vect...
CLUSTER
2001
IEEE
13 years 11 months ago
2001
IEEE
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...