Sciweavers

451 search results - page 30 / 91
» Partial Learning Using Link Grammars Data
Sort
View
90
Voted
ACL
2010
14 years 10 months ago
Profiting from Mark-Up: Hyper-Text Annotations for Guided Parsing
We show how web mark-up can be used to improve unsupervised dependency parsing. Starting from raw bracketings of four common HTML tags (anchors, bold, italics and underlines), we ...
Valentin I. Spitkovsky, Daniel Jurafsky, Hiyan Als...
98
Voted
PKDD
2010
Springer
158views Data Mining» more  PKDD 2010»
14 years 11 months ago
Learning Sparse Gaussian Markov Networks Using a Greedy Coordinate Ascent Approach
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...
Katya Scheinberg, Irina Rish
117
Voted
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
16 years 26 days ago
Learning a complex metabolomic dataset using random forests and support vector machines
Metabolomics is the omics science of biochemistry. The associated data include the quantitative measurements of all small molecule metabolites in a biological sample. These datase...
Young Truong, Xiaodong Lin, Chris Beecher
WIRN
2005
Springer
15 years 6 months ago
Recursive Neural Networks and Graphs: Dealing with Cycles
Recursive neural networks are a powerful tool for processing structured data. According to the recursive learning paradigm, the input information consists of directed positional ac...
Monica Bianchini, Marco Gori, Lorenzo Sarti, Franc...
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
15 years 5 months ago
Improving data mining utility with projective sampling
Overall performance of the data mining process depends not just on the value of the induced knowledge but also on various costs of the process itself such as the cost of acquiring...
Mark Last