Sciweavers

220 search results - page 15 / 44
» Discovering Test Set Regularities in Relational Domains
Sort
View
ADC
2003
Springer
182views Database» more  ADC 2003»
14 years 3 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
PODS
1997
ACM
124views Database» more  PODS 1997»
14 years 1 months ago
Languages for Relational Databases over Interpreted Structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
BMCBI
2004
108views more  BMCBI 2004»
13 years 9 months ago
Enhanced protein domain discovery using taxonomy
Background: It is well known that different species have different protein domain repertoires, and indeed that some protein domains are kingdom specific. This information has not ...
Lachlan James M. Coin, Alex Bateman, Richard Durbi...
ACL
2011
13 years 1 months ago
Effective Measures of Domain Similarity for Parsing
It is well known that parsing accuracy suffers when a model is applied to out-of-domain data. It is also known that the most beneficial data to parse a given domain is data that ...
Barbara Plank, Gertjan van Noord
AIME
1997
Springer
14 years 1 months ago
Detecting Very Early Stages of Dementia from Normal Aging with Machine Learning Methods
We used Machine Learning (ML) methods to learn the best decision rules to distinguish normal brain aging from the earliest stages of dementia using subsamples of 198 normal and 244...
William Rodman Shankle, Subramani Mani, Michael J....