Sciweavers

164 search results - page 8 / 33
» The Kolmogorov complexity of random reals
Sort
View
CVPR
2012
IEEE
11 years 9 months ago
Mode-seeking on graphs via random walks
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
Minsu Cho, Kyoung Mu Lee
ICPR
2000
IEEE
14 years 8 months ago
Measuring the Complexity of Classification Problems
We studied a number of measures that characterize the difficulty of a classification problem. We compared a set of real world problems to random combinations of points in this mea...
Tin Kam Ho, Mitra Basu
TSP
2010
13 years 2 months ago
Complex Gaussian scale mixtures of complex wavelet coefficients
In this paper, we propose the complex Gaussian scale mixture (CGSM) to model the complex wavelet coefficients as an extension of the Gaussian scale mixture (GSM), which is for real...
Yothin Rakvongthai, An P. N. Vo, Soontorn Oraintar...
DATAMINE
2006
176views more  DATAMINE 2006»
13 years 7 months ago
A Bit Level Representation for Time Series Data Mining with Shape Based Similarity
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
Anthony J. Bagnall, Chotirat (Ann) Ratanamahatana,...
INFOCOM
2012
IEEE
11 years 10 months ago
Sampling directed graphs with random walks
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
Bruno F. Ribeiro, Pinghui Wang, Fabricio Murai, Do...