Sciweavers

142 search results - page 23 / 29
» The Notion of Similarity in Data and Pattern Spaces
Sort
View
113
Voted
NIPS
2001
14 years 11 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
15 years 10 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
AAAI
2007
14 years 12 months ago
Discovering Multivariate Motifs using Subsequence Density Estimation and Greedy Mixture Learning
The problem of locating motifs in real-valued, multivariate time series data involves the discovery of sets of recurring patterns embedded in the time series. Each set is composed...
David Minnen, Charles Lee Isbell Jr., Irfan A. Ess...
AIPR
2001
IEEE
15 years 1 months ago
Model-Based Face Tracking for Dense Motion Field Estimation
When estimating the dense motion field of a video sequence, if little is known or assumed about the content, a limited constraint approach such as optical flow must be used. Since...
Timothy F. Gee, Russell M. Mersereau
CVPR
2009
IEEE
16 years 4 months ago
Active Learning for Large Multi-class Problems
Scarcity and infeasibility of human supervision for large scale multi-class classification problems necessitates active learning. Unfortunately, existing active learning methods ...
Prateek Jain (University of Texas at Austin), Ashi...