376 search results - page 15 / 76 » Efficient Indexing Structures for Mining Frequent Patterns |
ASWC
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Nowadays, the demand on querying and searching the Semantic Web is increasing. Some systems have adopted IR (Information Retrieval) approaches to index and search the Sem...
ACMSE
2009
ACM
14 years 3 months ago
2009
ACM
The mining of frequent sequential patterns has been a hot and well studied area—under the broad umbrella of research known as KDD (Knowledge Discovery and Data Mining)— for we...
IS
2008
13 years 8 months ago
2008
Discovering patterns with highly significance is an important problem in data mining discipline. An episode is defined to be a partially ordered set of events for a consecutive an...
FIMI
2004
13 years 10 months ago
2004
One of the main problems raising up in the frequent closed itemsets mining problem is the duplicate detection. In this paper we propose a general technique for promptly detecting ...
KDD
2004
ACM
14 years 9 months ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...