Sciweavers

291 search results - page 38 / 59
» Clustering and the Biclique Partition Problem
Sort
View
PAMI
2010
112views more  PAMI 2010»
13 years 7 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum
ICCBR
2003
Springer
14 years 2 months ago
Index Driven Selective Sampling for CBR
In real environments it is often difficult to obtain a collection of cases for the case base that would cover all the problem solving situations. Although it is often somewhat eas...
Nirmalie Wiratunga, Susan Craw, Stewart Massie
SASO
2007
IEEE
14 years 3 months ago
Clustering Distributed Energy Resources for Large-Scale Demand Management
Managing demand for electrical energy allows generation facilities to be run more efficiently. Current systems allow for management between large industrial consumers. There is, ...
Elth Ogston, Astrid Zeman, Mikhail Prokopenko, Geo...
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 9 months ago
Efficient Clustering with Limited Distance Information
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...
AAAI
2007
13 years 11 months ago
COD: Online Temporal Clustering for Outbreak Detection
We present Cluster Onset Detection (COD), a novel algorithm to aid in detection of epidemic outbreaks. COD employs unsupervised learning techniques in an online setting to partiti...
Tomás Singliar, Denver Dash