Sciweavers

1661 search results - page 96 / 333
» Decision Tree Fields
Sort
View
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
16 years 15 days ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
ACL
2009
15 years 4 months ago
Topological Field Parsing of German
Freer-word-order languages such as German exhibit linguistic phenomena that present unique challenges to traditional CFG parsing. Such phenomena produce discontinuous constituents...
Jackie Chi Kit Cheung, Gerald Penn
LION
2009
Springer
135views Optimization» more  LION 2009»
16 years 26 days ago
Neural Network Pairwise Interaction Fields for Protein Model Quality Assessment
We present a new knowledge-based Model Quality Assessment Program (MQAP) at the residue level which evaluates single protein structure models. We use a tree representation of the ...
Alberto J. M. Martin, Alessandro Vullo, Gianluca P...
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
16 years 8 days ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou
CISS
2007
IEEE
15 years 10 months ago
Energy Efficient Routing for Statistical Inference of Markov Random Fields
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
Animashree Anandkumar, Lang Tong, Ananthram Swami