Sciweavers

164 search results - page 25 / 33
» Maximally joining probabilistic data
Sort
View
MICCAI
2007
Springer
15 years 10 months ago
Shape Analysis Using a Point-Based Statistical Shape Model Built on Correspondence Probabilities
A fundamental problem when computing statistical shape models is the determination of correspondences between the instances of the associated data set. Often, homologies between po...
Heike Hufnagel, Xavier Pennec, Jan Ehrhardt, Heinz...
KDD
2007
ACM
206views Data Mining» more  KDD 2007»
15 years 10 months ago
Automatic labeling of multinomial topic models
Multinomial distributions over words are frequently used to model topics in text collections. A common, major challenge in applying all such topic models to any text mining proble...
Qiaozhu Mei, Xuehua Shen, ChengXiang Zhai
ICDM
2007
IEEE
187views Data Mining» more  ICDM 2007»
15 years 4 months ago
Statistical Learning Algorithm for Tree Similarity
Tree edit distance is one of the most frequently used distance measures for comparing trees. When using the tree edit distance, we need to determine the cost of each operation, bu...
Atsuhiro Takasu, Daiji Fukagawa, Tatsuya Akutsu
COMAD
2008
14 years 11 months ago
REBMEC: Repeat Based Maximum Entropy Classifier for Biological Sequences
An important problem in biological data analysis is to predict the family of a newly discovered sequence like a protein or DNA sequence, using the collection of available sequence...
Pratibha Rani, Vikram Pudi
CIKM
2008
Springer
14 years 11 months ago
Modeling hidden topics on document manifold
Topic modeling has been a key problem for document analysis. One of the canonical approaches for topic modeling is Probabilistic Latent Semantic Indexing, which maximizes the join...
Deng Cai, Qiaozhu Mei, Jiawei Han, Chengxiang Zhai