Sciweavers

982 search results - page 144 / 197
» Hierarchical comments-based clustering
Sort
View
PAMI
2011
13 years 4 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
JMM2
2007
122views more  JMM2 2007»
13 years 9 months ago
Hierarchical Model-Based Activity Recognition With Automatic Low-Level State Discovery
Abstract— Activity recognition in video streams is increasingly important for both the computer vision and artificial intelligence communities. Activity recognition has many app...
Justin Muncaster, Yunqian Ma
IJCNN
2000
IEEE
14 years 1 months ago
Regression Analysis for Rival Penalized Competitive Learning Binary Tree
The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index efficiency and the parameters of the Rival Penaliz...
Xuequn Li, Irwin King
ICPADS
2010
IEEE
13 years 7 months ago
Enhancing MapReduce via Asynchronous Data Processing
The MapReduce programming model simplifies large-scale data processing on commodity clusters by having users specify a map function that processes input key/value pairs to generate...
Marwa Elteir, Heshan Lin, Wu-chun Feng
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
14 years 13 days ago
Flexible constrained spectral clustering
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
Xiang Wang, Ian Davidson