Sciweavers

541 search results - page 96 / 109
» An Efficient Algorithm for the Longest Pattern Subsequence P...
Sort
View
ECML
2006
Springer
13 years 11 months ago
Deconvolutive Clustering of Markov States
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
Ata Kabán, Xin Wang
ICML
2010
IEEE
13 years 8 months ago
Submodular Dictionary Selection for Sparse Representation
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse,...
Andreas Krause, Volkan Cevher
PAMI
2008
391views more  PAMI 2008»
13 years 7 months ago
Riemannian Manifold Learning
Recently, manifold learning has been widely exploited in pattern recognition, data analysis, and machine learning. This paper presents a novel framework, called Riemannian manifold...
Tong Lin, Hongbin Zha
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
13 years 8 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar
KDD
2004
ACM
151views Data Mining» more  KDD 2004»
14 years 7 months ago
Feature selection in scientific applications
Numerous applications of data mining to scientific data involve the induction of a classification model. In many cases, the collection of data is not performed with this task in m...
Erick Cantú-Paz, Shawn Newsam, Chandrika Ka...