Sciweavers

3935 search results - page 68 / 787
» Database Support for Hypertext
Sort
View
CINQ
2004
Springer
151views Database» more  CINQ 2004»
13 years 11 months ago
Query Languages Supporting Descriptive Rule Mining: A Comparative Study
Recently, inductive databases (IDBs) have been proposed to tackle the problem of knowledge discovery from huge databases. With an IDB, the user/analyst performs a set of very diffe...
Marco Botta, Jean-François Boulicaut, Cyril...
ICDE
2004
IEEE
116views Database» more  ICDE 2004»
14 years 9 months ago
An Efficient Algorithm for Mining Frequent Sequences by a New Strategy without Support Counting
Mining sequential patterns in large databases is an important research topic. The main challenge of mining sequential patterns is the high processing cost due to the large amount ...
Ding-Ying Chiu, Yi-Hung Wu, Arbee L. P. Chen
CINQ
2004
Springer
180views Database» more  CINQ 2004»
13 years 11 months ago
Interactivity, Scalability and Resource Control for Efficient KDD Support in DBMS
The conflict between resource consumption and query performance in the data mining context often has no satisfactory solution. This not only stands in sharp contrast to the need of...
Matthias Gimbel, Michael Klein, Peter C. Lockemann
ICDM
2007
IEEE
118views Data Mining» more  ICDM 2007»
14 years 2 months ago
Subgraph Support in a Single Large Graph
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
Mathias Fiedler, Christian Borgelt
MLG
2007
Springer
14 years 1 months ago
Support Computation for Mining Frequent Subgraphs in a Single Graph
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
Mathias Fiedler, Christian Borgelt