Sciweavers

12 search results - page 1 / 3
» Mining all frequent projection-selection queries from a rela...
Sort
View
EDBT
2008
ACM
122views Database» more  EDBT 2008»
14 years 5 months ago
Mining all frequent projection-selection queries from a relational table
In this paper we study the problem of mining all frequent queries in a given database table, a problem known to be intractable even for conjunctive queries. We restrict our attent...
Tao-Yuan Jen, Dominique Laurent, Nicolas Spyratos
LWA
2004
13 years 6 months ago
Efficient Frequent Pattern Mining in Relational Databases
Data mining on large relational databases has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind ...
Xuequn Shang, Kai-Uwe Sattler, Ingolf Geist
DASFAA
2005
IEEE
153views Database» more  DASFAA 2005»
13 years 10 months ago
FASST Mining: Discovering Frequently Changing Semantic Structure from Versions of Unordered XML Documents
Abstract. In this paper, we present a FASST mining approach to extract the frequently changing semantic structures (FASSTs), which are a subset of semantic substructures that chang...
Qiankun Zhao, Sourav S. Bhowmick
ADMA
2008
Springer
147views Data Mining» more  ADMA 2008»
13 years 11 months ago
Mining Supplemental Frequent Patterns
The process of resource distribution and load balance of a distributed P2P network can be described as the process of mining Supplement Frequent Patterns (SFPs) from query transact...
Yintian Liu, Yingming Liu, Tao Zeng, Kaikuo Xu, Ro...
DAWAK
2005
Springer
13 years 10 months ago
Processing Sequential Patterns in Relational Databases
Database integration of data mining has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind specia...
Xuequn Shang, Kai-Uwe Sattler