Sciweavers

11 search results - page 2 / 3
» A new efficient probabilistic model for mining labeled order...
Sort
View
TKDE
2008
153views more  TKDE 2008»
13 years 7 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Sen Zhang, Jason Tsong-Li Wang
KDD
2009
ACM
219views Data Mining» more  KDD 2009»
14 years 8 months ago
Structured correspondence topic models for mining captioned figures in biological literature
A major source of information (often the most crucial and informative part) in scholarly articles from scientific journals, proceedings and books are the figures that directly pro...
Amr Ahmed, Eric P. Xing, William W. Cohen, Robert ...
KDD
2008
ACM
135views Data Mining» more  KDD 2008»
14 years 8 months ago
Effective and efficient itemset pattern summarization: regression-based approaches
In this paper, we propose a set of novel regression-based approaches to effectively and efficiently summarize frequent itemset patterns. Specifically, we show that the problem of ...
Ruoming Jin, Muad Abu-Ata, Yang Xiang, Ning Ruan
3DOR
2008
13 years 10 months ago
Markov Random Fields for Improving 3D Mesh Analysis and Segmentation
Mesh analysis and clustering have became important issues in order to improve the efficiency of common processing operations like compression, watermarking or simplification. In t...
Guillaume Lavoué, Christian Wolf
NIPS
2008
13 years 9 months ago
Multiscale Random Fields with Application to Contour Grouping
We introduce a new interpretation of multiscale random fields (MSRFs) that admits efficient optimization in the framework of regular (single level) random fields (RFs). It is base...
Longin Jan Latecki, ChengEn Lu, Marc Sobel, Xiang ...