Sciweavers

917 search results - page 57 / 184
» Mining interesting sets and rules in relational databases
Sort
View
CINQ
2004
Springer
125views Database» more  CINQ 2004»
14 years 2 months ago
Deducing Bounds on the Support of Itemsets
Mining Frequent Itemsets is the core operation of many data mining algorithms. This operation however, is very data intensive and sometimes produces a prohibitively large output. I...
Toon Calders
WISE
2003
Springer
14 years 2 months ago
Publishing and Querying the Histories of Archived Relational Databases in XML
There is much current interest in publishing and viewing databases as XML documents. The general benefits of this approach follow from the popularity of XML and the tool set avai...
Fusheng Wang, Carlo Zaniolo
EDBT
2010
ACM
177views Database» more  EDBT 2010»
13 years 11 months ago
PerK: personalized keyword search in relational databases through preferences
Keyword-based search in relational databases allows users to discover relevant information without knowing the database schema or using complicated queries. However, such searches...
Kostas Stefanidis, Marina Drosou, Evaggelia Pitour...
ICDM
2007
IEEE
155views Data Mining» more  ICDM 2007»
14 years 26 days ago
Transitional Patterns and Their Significant Milestones
Mining frequent patterns in transaction databases has been studied extensively in data mining research. However, most of the existing frequent pattern mining algorithms do not con...
Qian Wan, Aijun An
DEXA
2007
Springer
98views Database» more  DEXA 2007»
14 years 3 months ago
Extracting Sequential Nuggets of Knowledge
Abstract. We present the notion of sequential association rule and introduce Sequential Nuggets of Knowledge as sequential association rules with possible low support and good qual...
Christine Froidevaux, Frédérique Lis...