Sciweavers

3607 search results - page 177 / 722
» Learning with structured sparsity
Sort
View
ML
2011
ACM
179views Machine Learning» more  ML 2011»
14 years 10 months ago
Neural networks for relational learning: an experimental comparison
In the last decade, connectionist models have been proposed that can process structured information directly. These methods, which are based on the use of graphs for the representa...
Werner Uwents, Gabriele Monfardini, Hendrik Blocke...
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
16 years 4 months ago
Unsupervised learning on k-partite graphs
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
Bo Long, Xiaoyun Wu, Zhongfei (Mark) Zhang, Philip...
168
Voted
BMCBI
2011
14 years 10 months ago
DoBo: Protein domain boundary prediction by integrating evolutionary signals and machine learning
Background: Accurate identification of protein domain boundaries is useful for protein structure determination and prediction. However, predicting protein domain boundaries from a...
Jesse Eickholt, Xin Deng, Jianlin Cheng
LREC
2010
145views Education» more  LREC 2010»
15 years 5 months ago
Generic Ontology Learners on Application Domains
In ontology learning from texts, we have ontology-rich domains where we have large structured domain knowledge repositories or we have large general corpora with large general str...
Francesca Fallucchi, Maria Teresa Pazienza, Fabio ...
172
Voted
ILP
2007
Springer
15 years 10 months ago
Combining Clauses with Various Precisions and Recalls to Produce Accurate Probabilistic Estimates
Statistical Relational Learning (SRL) combines the benefits of probabilistic machine learning approaches with complex, structured domains from Inductive Logic Programming (ILP). W...
Mark Goadrich, Jude W. Shavlik