917 search results - page 118 / 184 » Mining interesting sets and rules in relational databases |
BMCBI
2007
14 years 10 months ago
2007
Background: Relating features of protein sequences to structural hinges is important for identifying domain boundaries, understanding structure-function relationships, and designi...
DAGSTUHL
2004
14 years 11 months ago
2004
Subgroup discovery aims at finding interesting subsets of a classified example set that deviates from the overall distribution. The search is guided by a so-called utility function...
SIGMOD
2002
ACM
15 years 10 months ago
2002
ACM
Ontologies in current computer science parlance are computer based resources that represent agreed domain semantics. Unlike data models, the fundamental asset of ontologies is the...
CINQ
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...