Sciweavers

1314 search results - page 28 / 263
» Approximate data mining in very large relational data
Sort
View
ICDM
2009
IEEE
134views Data Mining» more  ICDM 2009»
13 years 5 months ago
Efficient Discovery of Confounders in Large Data Sets
Given a large transaction database, association analysis is concerned with efficiently finding strongly related objects. Unlike traditional associate analysis, where relationships ...
Wenjun Zhou, Hui Xiong
DAWAK
2008
Springer
13 years 9 months ago
Mining Multidimensional Sequential Patterns over Data Streams
Sequential pattern mining is an active field in the domain of knowledge discovery and has been widely studied for over a decade by data mining researchers. More and more, with the ...
Chedy Raïssi, Marc Plantevit
ICDM
2006
IEEE
161views Data Mining» more  ICDM 2006»
14 years 1 months ago
Hierarchical Density Shaving: A clustering and visualization framework for large biological datasets
In many clustering applications for bioinformatics, only part of the data clusters into one or more groups while the rest needs to be pruned. For such situations, we present Hiera...
Gunjan Gupta, Alexander Liu, Joydeep Ghosh
SDM
2007
SIAM
118views Data Mining» more  SDM 2007»
13 years 8 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
1995
ACM
129views Data Mining» more  KDD 1995»
13 years 11 months ago
Feature Extraction for Massive Data Mining
Techniques for learning from data typically require data to be in standard form. Measurements must be encoded in a numerical format such as binary true-or-false features, numerica...
V. Seshadri, Raguram Sasisekharan, Sholom M. Weiss