Sciweavers

1768 search results - page 107 / 354
» Mining Very Large Databases
Sort
View
PKDD
1998
Springer
113views Data Mining» more  PKDD 1998»
15 years 6 months ago
Text Mining at the Term Level
Knowledge Discovery in Databases (KDD) focuses on the computerized exploration of large amounts of data and on the discovery of interesting patterns within them. While most work on...
Ronen Feldman, Moshe Fresko, Yakkov Kinar, Yehuda ...
149
Voted
SAC
2011
ACM
14 years 5 months ago
RuleGrowth: mining sequential rules common to several sequences by pattern-growth
Mining sequential rules from large databases is an important topic in data mining fields with wide applications. Most of the relevant studies focused on finding sequential rules a...
Philippe Fournier-Viger, Roger Nkambou, Vincent Sh...
117
Voted
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
15 years 11 months ago
GAD: General Activity Detection for Fast Clustering on Large Data.
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...
Jiawei Han, Liangliang Cao, Sangkyum Kim, Xin Jin,...
113
Voted
VLDB
2005
ACM
118views Database» more  VLDB 2005»
15 years 8 months ago
Selectivity Estimation for Fuzzy String Predicates in Large Data Sets
Many database applications have the emerging need to support fuzzy queries that ask for strings that are similar to a given string, such as “name similar to smith” and “tele...
Liang Jin, Chen Li
114
Voted
KDD
2002
ACM
155views Data Mining» more  KDD 2002»
16 years 3 months ago
SyMP: an efficient clustering approach to identify clusters of arbitrary shapes in large data sets
We propose a new clustering algorithm, called SyMP, which is based on synchronization of pulse-coupled oscillators. SyMP represents each data point by an Integrate-and-Fire oscill...
Hichem Frigui