276 search results - page 6 / 56 » Frequent Submap Discovery |
KDD
2006
ACM
14 years 10 months ago
2006
ACM
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
IEEEHPCS
2010
13 years 8 months ago
2010
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...
CINQ
2004
Springer
14 years 1 months ago
2004
Springer
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...
SIGOPSE
2004
ACM
14 years 3 months ago
2004
ACM
: Service discovery in Ubiquitous Computing is a task which has to be done frequently due to dynamically changing environments. The limited battery power of mobile devices requires...
IDEAL
2003
Springer
14 years 2 months ago
2003
Springer
Mining frequent patterns has been a topic of active research because it is computationally the most expensive step in association rule discovery. In this paper, we discuss the use ...