Sciweavers

2383 search results - page 6 / 477
» Finding Representative Set from Massive Data
Sort
View
CIKM
2008
Springer
13 years 8 months ago
On effective presentation of graph patterns: a structural representative approach
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
Chen Chen, Cindy Xide Lin, Xifeng Yan, Jiawei Han
SDM
2011
SIAM
256views Data Mining» more  SDM 2011»
12 years 9 months ago
Temporal Structure Learning for Clustering Massive Data Streams in Real-Time
This paper describes one of the first attempts to model the temporal structure of massive data streams in real-time using data stream clustering. Recently, many data stream clust...
Michael Hahsler, Margaret H. Dunham
ICML
2010
IEEE
13 years 7 months ago
Budgeted Nonparametric Learning from Data Streams
We consider the problem of extracting informative exemplars from a data stream. Examples of this problem include exemplarbased clustering and nonparametric inference such as Gauss...
Ryan Gomes, Andreas Krause
IEEEVAST
2010
13 years 1 months ago
Finding and visualizing relevant subspaces for clustering high-dimensional astronomical data using connected morphological opera
Data sets in astronomy are growing to enormous sizes. Modern astronomical surveys provide not only image data but also catalogues of millions of objects (stars, galaxies), each ob...
Bilkis J. Ferdosi, Hugo Buddelmeijer, Scott Trager...
GECCO
2007
Springer
163views Optimization» more  GECCO 2007»
14 years 26 days ago
Discovering event evidence amid massive, dynamic datasets
Automated event extraction remains a very difficult challenge requiring information analysts to manually identify key events of interest within massive, dynamic data. Many techniq...
Robert M. Patton, Thomas E. Potok