Sciweavers

2878 search results - page 30 / 576
» Learning the Common Structure of Data
Sort
View
CORR
2006
Springer
99views Education» more  CORR 2006»
13 years 8 months ago
Logical settings for concept learning from incomplete examples in First Order Logic
We investigate here concept learning from incomplete examples. Our first purpose is to discuss to what extent logical learning settings have to be modified in order to cope with da...
Dominique Bouthinon, Henry Soldano, Véroniq...
KDD
1995
ACM
148views Data Mining» more  KDD 1995»
13 years 12 months ago
Learning Arbiter and Combiner Trees from Partitioned Data for Scaling Machine Learning
Knowledge discovery in databases has become an increasingly important research topic with the advent of wide area network computing. One of the crucial problems we study in this p...
Philip K. Chan, Salvatore J. Stolfo
ICML
2002
IEEE
14 years 9 months ago
Kernels for Semi-Structured Data
Semi-structured data such as XML and HTML is attracting considerable attention. It is important to develop various kinds of data mining techniques that can handle semistructured d...
Hisashi Kashima, Teruo Koyanagi
ECML
2007
Springer
14 years 2 months ago
Optimizing Feature Sets for Structured Data
Choosing a suitable feature representation for structured data is a non-trivial task due to the vast number of potential candidates. Ideally, one would like to pick a small, but in...
Ulrich Rückert, Stefan Kramer
JCDL
2006
ACM
151views Education» more  JCDL 2006»
14 years 2 months ago
Tagging of name records for genealogical data browsing
In this paper we present a method of parsing unstructured textual records briefly describing a person and their direct relatives, which we use in the construction of a browsing t...
Mike Perrow, David Barber