553 search results - page 24 / 111 » A Compress-Based Association Mining Algorithm for Large Data... |
KDD
2008
ACM
15 years 10 months ago
2008
ACM
We present a prototype of an inductive database. Our system enables the user to query not only the data stored in the database but also generalizations (e.g. rules or trees) over ...
PAKDD
2004
ACM
15 years 3 months ago
2004
ACM
We are designing new data mining techniques on boolean contexts to identify a priori interesting concepts, i.e., closed sets of objects (or transactions) and associated closed sets...
DASFAA
2007
IEEE
2007
IEEE
LAPIN: Effective Sequential Pattern Mining Algorithms by Last Position Induction for Dense Databases
15 years 4 months ago
Sequential pattern mining is very important because it is the basis of many applications. Although there has been a great deal of effort on sequential pattern mining in recent year...
100
click to vote
DGO
2007
14 years 11 months ago
2007
We present D-HOTM, a framework for Distributed Higher Order Text Mining based on named entities extracted from textual data that are stored in distributed relational databases. Unl...
SIGMOD
1997
ACM
15 years 2 months ago
1997
ACM
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...