Sciweavers

25041 search results - page 177 / 5009
» Algorithms for Clustering Data
Sort
View
WIMOB
2008
IEEE
14 years 4 months ago
Rate Allocation with Lifetime Maximization and Fairness for Data Aggregation in Sensor Networks
—We consider the rate allocation problem for data aggregation in wireless sensor networks with two objectives: 1) maximizing the lifetime of a local aggregation cluster and, 2) a...
Shouwen Lai, Binoy Ravindran, Hyeonjoong Cho
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
14 years 10 months ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
PODS
2005
ACM
115views Database» more  PODS 2005»
14 years 9 months ago
A divide-and-merge methodology for clustering
We present a divide-and-merge methodology for clustering a set of objects that combines a top-down "divide" phase with a bottom-up "merge" phase. In contrast, ...
David Cheng, Santosh Vempala, Ravi Kannan, Grant W...
ADMA
2009
Springer
145views Data Mining» more  ADMA 2009»
14 years 4 months ago
A Framework for Multi-Objective Clustering and Its Application to Co-Location Mining
The goal of multi-objective clustering (MOC) is to decompose a dataset into similar groups maximizing multiple objectives in parallel. In this paper, we provide a methodology, arch...
Rachsuda Jiamthapthaksin, Christoph F. Eick, Ricar...
BMCBI
2007
178views more  BMCBI 2007»
13 years 9 months ago
SVM clustering
Background: Support Vector Machines (SVMs) provide a powerful method for classification (supervised learning). Use of SVMs for clustering (unsupervised learning) is now being cons...
Stephen Winters-Hilt, Sam Merat