Sciweavers

1971 search results - page 42 / 395
» A clustering method that uses lossy aggregation of data
Sort
View
DEXAW
2009
IEEE
173views Database» more  DEXAW 2009»
14 years 2 months ago
Automatic Cluster Number Selection Using a Split and Merge K-Means Approach
Abstract—The k-means method is a simple and fast clustering technique that exhibits the problem of specifying the optimal number of clusters preliminarily. We address the problem...
Markus Muhr, Michael Granitzer
WSC
2008
13 years 10 months ago
Simplification and aggregation strategies applied for factory analysis in conceptual phase using simulation
Despite that simulation possesses an establish background and offers tremendous promise for designing and analyzing complex production systems, manufacturing industry has been les...
Matias Urenda Moris, Amos Ng, Jacob Svensson
ICDE
2006
IEEE
95views Database» more  ICDE 2006»
14 years 9 months ago
Learning from Aggregate Views
In this paper, we introduce a new class of data mining problems called learning from aggregate views. In contrast to the traditional problem of learning from a single table of tra...
Bee-Chung Chen, Lei Chen 0003, Raghu Ramakrishnan,...
PACS
2004
Springer
172views Hardware» more  PACS 2004»
14 years 1 months ago
Safe Overprovisioning: Using Power Limits to Increase Aggregate Throughput
Management of power in data centers is driven by the need to not exceed circuit capacity. The methods employed in the oversight of these power circuits are typically static and ad...
Mark E. Femal, Vincent W. Freeh
WSDM
2012
ACM
252views Data Mining» more  WSDM 2012»
12 years 3 months ago
WebSets: extracting sets of entities from the web using unsupervised information extraction
We describe a open-domain information extraction method for extracting concept-instance pairs from an HTML corpus. Most earlier approaches to this problem rely on combining cluste...
Bhavana Bharat Dalvi, William W. Cohen, Jamie Call...