Sciweavers

576 search results - page 92 / 116
» Structured metric learning for high dimensional problems
Sort
View
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
14 years 1 months ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
DAWAK
2004
Springer
14 years 1 months ago
Multidimensional Data Visual Exploration by Interactive Information Segments
Visualization techniques provide an outstanding role in KDD process for data analysis and mining. However, one image does not always convey successfully the inherent information fr...
Francisco J. Ferrer-Troyano, Jesús S. Aguil...
ECCV
2010
Springer
13 years 12 months ago
Kernel Sparse Representation for Image Classification and Face Recognition
Recent research has shown the effectiveness of using sparse coding(Sc) to solve many computer vision problems. Motivated by the fact that kernel trick can capture the nonlinear sim...
AI
2007
Springer
13 years 7 months ago
Learning, detection and representation of multi-agent events in videos
In this paper, we model multi-agent events in terms of a temporally varying sequence of sub-events, and propose a novel approach for learning, detecting and representing events in...
Asaad Hakeem, Mubarak Shah
ACL
2007
13 years 9 months ago
A fully Bayesian approach to unsupervised part-of-speech tagging
Unsupervised learning of linguistic structure is a difficult problem. A common approach is to define a generative model and maximize the probability of the hidden structure give...
Sharon Goldwater, Tom Griffiths