Sciweavers

725 search results - page 103 / 145
» A General Greedy Approximation Algorithm with Applications
Sort
View
KDD
2006
ACM
163views Data Mining» more  KDD 2006»
15 years 10 months ago
New EM derived from Kullback-Leibler divergence
We introduce a new EM framework in which it is possible not only to optimize the model parameters but also the number of model components. A key feature of our approach is that we...
Longin Jan Latecki, Marc Sobel, Rolf Lakämper
AAAI
2011
13 years 9 months ago
Coarse-to-Fine Inference and Learning for First-Order Probabilistic Models
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...
Chloe Kiddon, Pedro Domingos
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
15 years 10 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
SMA
2003
ACM
154views Solid Modeling» more  SMA 2003»
15 years 2 months ago
Discretization of functionally based heterogeneous objects
The presented approach to discretization of functionally defined heterogeneous objects is oriented towards applications associated with numerical simulation procedures, for exampl...
Elena Kartasheva, Valery Adzhiev, Alexander A. Pas...
ICPR
2006
IEEE
15 years 3 months ago
Regularized Locality Preserving Learning of Pre-Image Problem in Kernel Principal Component Analysis
In this paper, we address the pre-image problem in kernel principal component analysis (KPCA). The preimage problem finds a pattern as the pre-image of a feature vector defined in...
Weishi Zheng, Jian-Huang Lai