Sciweavers

1861 search results - page 25 / 373
» 1.6-Bit Pattern Databases
Sort
View
IDEAS
2008
IEEE
153views Database» more  IDEAS 2008»
15 years 4 months ago
Pattern based processing of XPath queries
As the popularity of areas including document storage and distributed systems continues to grow, the demand for high performance XML databases is increasingly evident. This has le...
Gerard Marks, Mark Roantree
KDD
1994
ACM
118views Data Mining» more  KDD 1994»
15 years 1 months ago
Discovering Informative Patterns and Data Cleaning
Wepresent a methodfor discovering informative patterns from data. With this method,large databases can be reducedto only a few representative data entries. Ourframeworkencompasses...
Isabelle Guyon, Nada Matic, Vladimir Vapnik
PKDD
1998
Springer
123views Data Mining» more  PKDD 1998»
15 years 1 months ago
Querying Inductive Databases: A Case Study on the MINE RULE Operator
Knowledge discovery in databases (KDD) is a process that can include steps like forming the data set, data transformations, discovery of patterns, searching for exceptions to a pat...
Jean-François Boulicaut, Mika Klemettinen, ...
CINQ
2004
Springer
157views Database» more  CINQ 2004»
15 years 1 months ago
Inductive Databases and Multiple Uses of Frequent Itemsets: The cInQ Approach
Inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operat...
Jean-François Boulicaut
CIKM
2009
Springer
15 years 4 months ago
Graph classification based on pattern co-occurrence
Subgraph patterns are widely used in graph classification, but their effectiveness is often hampered by large number of patterns or lack of discrimination power among individual p...
Ning Jin, Calvin Young, Wei Wang