Sciweavers

376 search results - page 37 / 76
» Efficient Indexing Structures for Mining Frequent Patterns
Sort
View
WWW
2008
ACM
16 years 14 days ago
Scaling RDF with time
The World Wide Web Consortium's RDF standard primarily consists of (subject,property,object) triples that specify the value that a given subject has for a given property. How...
Andrea Pugliese, Octavian Udrea, V. S. Subrahmania...
CIKM
2006
Springer
15 years 3 months ago
TRIPS and TIDES: new algorithms for tree mining
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
Shirish Tatikonda, Srinivasan Parthasarathy, Tahsi...
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
16 years 5 days ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...
ADBIS
2000
Springer
88views Database» more  ADBIS 2000»
15 years 4 months ago
Finding Generalized Path Patterns for Web Log Data Mining
Conducting data mining on logs of web servers involves the determination of frequently occurring access sequences. We examine the problem of finding traversal patterns from web lo...
Alexandros Nanopoulos, Yannis Manolopoulos
BIS
2010
159views Business» more  BIS 2010»
14 years 6 months ago
Comparing Intended and Real Usage in Web Portal: Temporal Logic and Data Mining
Nowadays the software systems, including web portals, are developed from a priori assumptions about how the system will be used. However, frequently these assumptions hold only par...
Jérémy Besson, Ieva Mitasiunaite, Au...