Sciweavers

126 search results - page 15 / 26
» Finding low-entropy sets and trees from binary data
Sort
View
ACL
2009
14 years 9 months ago
Unsupervised Multilingual Grammar Induction
We investigate the task of unsupervised constituency parsing from bilingual parallel corpora. Our goal is to use bilingual cues to learn improved parsing models for each language ...
Benjamin Snyder, Tahira Naseem, Regina Barzilay
BMCBI
2008
96views more  BMCBI 2008»
14 years 11 months ago
Novel methodology for construction and pruning of quasi-median networks
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
Sarah C. Ayling, Terence A. Brown
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
15 years 6 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
ESANN
2004
15 years 1 months ago
Neural networks for data mining: constrains and open problems
When we talk about using neural networks for data mining we have in mind the original data mining scope and challenge. How did neural networks meet this challenge? Can we run neura...
Razvan Andonie, Boris Kovalerchuk
KDD
2009
ACM
229views Data Mining» more  KDD 2009»
16 years 5 days ago
An association analysis approach to biclustering
The discovery of biclusters, which denote groups of items that show coherent values across a subset of all the transactions in a data set, is an important type of analysis perform...
Gaurav Pandey, Gowtham Atluri, Michael Steinbach, ...