Sciweavers

1971 search results - page 170 / 395
» A clustering method that uses lossy aggregation of data
Sort
View
CVPR
2007
IEEE
14 years 11 months ago
Fiber Tract Clustering on Manifolds With Dual Rooted-Graphs
We propose a manifold learning approach to fiber tract clustering using a novel similarity measure between fiber tracts constructed from dual-rooted graphs. In particular, to gene...
Andy Tsai, Carl-Fredrik Westin, Alfred O. Hero, Al...
ICDE
2009
IEEE
174views Database» more  ICDE 2009»
14 years 4 months ago
Sketching Sampled Data Streams
—Sampling is used as a universal method to reduce the running time of computations – the computation is performed on a much smaller sample and then the result is scaled to comp...
Florin Rusu, Alin Dobra
CAV
2005
Springer
104views Hardware» more  CAV 2005»
14 years 2 months ago
Expand, Enlarge and Check... Made Efficient
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
Gilles Geeraerts, Jean-François Raskin, Lau...
CN
2006
163views more  CN 2006»
13 years 9 months ago
A framework for mining evolving trends in Web data streams using dynamic learning and retrospective validation
The expanding and dynamic nature of the Web poses enormous challenges to most data mining techniques that try to extract patterns from Web data, such as Web usage and Web content....
Olfa Nasraoui, Carlos Rojas, Cesar Cardona
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
14 years 9 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis