Sciweavers

4560 search results - page 53 / 912
» Finding Data in the Neighborhood
Sort
View
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
14 years 8 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
ICDE
2010
IEEE
222views Database» more  ICDE 2010»
13 years 6 months ago
Finding Clusters in subspaces of very large, multi-dimensional datasets
Abstract— We propose the Multi-resolution Correlation Cluster detection (MrCC), a novel, scalable method to detect correlation clusters able to analyze dimensional data in the ra...
Robson Leonardo Ferreira Cordeiro, Agma J. M. Trai...
ICIP
2009
IEEE
14 years 9 months ago
Weighted Average Denoising With Sparse Orthonormal Transforms
Sparse Orthonormal Transforms (SOT) has recently been proposed as a data compression method that can achieve sparser representations in transform domain. Given initial conditions,...
IPMI
2001
Springer
14 years 8 months ago
Partial Volume Segmentation of Cerebral MRI Scans with Mixture Model Clustering
A mixture model clustering algorithm is presented for robust MRI brain image segmentation in the presence of partial volume averaging. The method uses additional classes to represe...
Aljaz Noe, James C. Gee
ICPR
2010
IEEE
13 years 8 months ago
Detection of Salient Image Points Using Principal Subspace Manifold Structure
—This paper presents a method to find salient image points in images with regular patterns based on deviations from the overall manifold structure. The two main contributions ar...
António R. C. Paiva, Tolga Tasdizen