Sciweavers

124 search results - page 10 / 25
» Scalable Model-based Clustering by Working on Data Summaries
Sort
View
EDBT
2011
ACM
256views Database» more  EDBT 2011»
12 years 11 months ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...
SPIESR
2003
136views Database» more  SPIESR 2003»
13 years 8 months ago
Media segmentation using self-similarity decomposition
We present a framework for analyzing the structure of digital media streams. Though our methods work for video, text, and audio, we concentrate on detecting the structure of digit...
Jonathan Foote, Matthew L. Cooper
SENSYS
2006
ACM
14 years 1 months ago
Data analysis tools for sensor-based science
Science is increasingly driven by data collected automatically from arrays of inexpensive sensors. The collected data volumes require a different approach from the scientists'...
Stuart Ozer, Jim Gray, Alexander S. Szalay, Andrea...
DMKD
1997
ACM
198views Data Mining» more  DMKD 1997»
13 years 11 months ago
Clustering Based On Association Rule Hypergraphs
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...
Eui-Hong Han, George Karypis, Vipin Kumar, Bamshad...
ICPR
2006
IEEE
14 years 8 months ago
Scalable Representative Instance Selection and Ranking
Finding a small set of representative instances for large datasets can bring various benefits to data mining practitioners so they can (1) build a learner superior to the one cons...
Xindong Wu, Xingquan Zhu