Sciweavers

728 search results - page 16 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
KDD
2004
ACM
144views Data Mining» more  KDD 2004»
14 years 8 months ago
IncSpan: incremental mining of sequential patterns in large database
Many real life sequence databases, such as customer shopping sequences, medical treatment sequences, etc., grow incrementally. It is undesirable to mine sequential patterns from s...
Hong Cheng, Xifeng Yan, Jiawei Han
PKDD
1999
Springer
118views Data Mining» more  PKDD 1999»
13 years 12 months ago
Mining Possibilistic Set-Valued Rules by Generating Prime Disjunctions
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
Alexandr A. Savinov
SBACPAD
2003
IEEE
180views Hardware» more  SBACPAD 2003»
14 years 28 days ago
New Parallel Algorithms for Frequent Itemset Mining in Very Large Databases
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
Adriano Veloso, Wagner Meira Jr., Srinivasan Parth...
SDM
2007
SIAM
118views Data Mining» more  SDM 2007»
13 years 9 months ago
On Privacy-Preservation of Text and Sparse Binary Data with Sketches
In recent years, privacy preserving data mining has become very important because of the proliferation of large amounts of data on the internet. Many data sets are inherently high...
Charu C. Aggarwal, Philip S. Yu
KDD
2004
ACM
285views Data Mining» more  KDD 2004»
14 years 1 months ago
Effective localized regression for damage detection in large complex mechanical structures
In this paper, we propose a novel data mining technique for the efficient damage detection within the large-scale complex mechanical structures. Every mechanical structure is defi...
Aleksandar Lazarevic, Ramdev Kanapady, Chandrika K...