Sciweavers

5096 search results - page 88 / 1020
» Landscape of Clustering Algorithms
Sort
View
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
16 years 1 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
GLOBECOM
2006
IEEE
15 years 10 months ago
Distributed Formation of Overlapping Multi-hop Clusters in Wireless Sensor Networks
– Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Most of the published clustering algorithms strive to generate t...
Adel M. Youssef, Mohamed F. Younis, Moustafa Youss...
WEBI
2005
Springer
15 years 10 months ago
Standardized Evaluation Method for Web Clustering Results
Finding a set of web pages relevant to a user’s information goal is difficult due to the enormous size of the Internet. Search engines are able to find a set of pages that mat...
Daniel Crabtree, Xiaoying Gao, Peter Andreae
146
Voted
EDBT
2004
ACM
192views Database» more  EDBT 2004»
16 years 4 months ago
LIMBO: Scalable Clustering of Categorical Data
Abstract. Clustering is a problem of great practical importance in numerous applications. The problem of clustering becomes more challenging when the data is categorical, that is, ...
Periklis Andritsos, Panayiotis Tsaparas, Ren&eacut...
CLUSTER
2007
IEEE
15 years 10 months ago
Dynamic scheduling of multi-processor tasks on clusters of clusters
— In this article we tackle the problem of scheduling a dynamically generated DAG of multi-processor tasks (M-tasks). At first, we outline the need of such a scheduling approach...
Sascha Hunold, Thomas Rauber, Gudula Rünger