Sciweavers

917 search results - page 52 / 184
» Mining interesting sets and rules in relational databases
Sort
View
WWW
2008
ACM
14 years 9 months ago
Efficient mining of frequent sequence generators
Sequential pattern mining has raised great interest in data mining research field in recent years. However, to our best knowledge, no existing work studies the problem of frequent...
Chuancong Gao, Jianyong Wang, Yukai He, Lizhu Zhou
SSD
1997
Springer
140views Database» more  SSD 1997»
14 years 1 months ago
Spatial Data Mining: A Database Approach
Abstract. Knowledge discovery in databases (KDD) is an important task in spatial databases since both, the number and the size of such databases are rapidly growing. This paper int...
Martin Ester, Hans-Peter Kriegel, Jörg Sander
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 3 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
PAKDD
2005
ACM
128views Data Mining» more  PAKDD 2005»
14 years 2 months ago
A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets
Traditional association rules mining cannot meet the demands arising from some real applications. By considering the different values of individual items as utilities, utility mini...
Ying Liu, Wei-keng Liao, Alok N. Choudhary
ICDE
2009
IEEE
290views Database» more  ICDE 2009»
14 years 10 months ago
GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases
Graphs are being increasingly used to model a wide range of scientific data. Such widespread usage of graphs has generated considerable interest in mining patterns from graph datab...
Sayan Ranu, Ambuj K. Singh