Sciweavers

150 search results - page 2 / 30
» Top 10 algorithms in data mining
Sort
View
ICDM
2002
IEEE
145views Data Mining» more  ICDM 2002»
13 years 10 months ago
Mining Top-K Frequent Closed Patterns without Minimum Support
In this paper, we propose a new mining task: mining top-k frequent closed patterns of length no less than min , where k is the desired number of frequent closed patterns to be min...
Jiawei Han, Jianyong Wang, Ying Lu, Petre Tzvetkov
DASFAA
2006
IEEE
126views Database» more  DASFAA 2006»
13 years 11 months ago
An Efficient Approach for Mining Top-K Fault-Tolerant Repeating Patterns
Abstract. In this paper, an efficient strategy for mining top-K non-trivial faulttolerant repeating patterns (FT-RPs in short) with lengths no less than min_len from data sequences...
Jia-Ling Koh, Yu-Ting Kung
SDM
2007
SIAM
149views Data Mining» more  SDM 2007»
13 years 6 months ago
WAT: Finding Top-K Discords in Time Series Database
Finding discords in time series database is an important problem in a great variety of applications, such as space shuttle telemetry, mechanical industry, biomedicine, and financ...
Yingyi Bu, Oscar Tat-Wing Leung, Ada Wai-Chee Fu, ...
DASFAA
2009
IEEE
93views Database» more  DASFAA 2009»
14 years 2 days ago
Top-K Correlation Sub-graph Search in Graph Databases
Recently, due to its wide applications, (similar) subgraph search has attracted a lot of attentions from database and data mining community, such as [13, 18, 19, 5]. In [8], Ke et ...
Lei Zou, Lei Chen 0002, Yansheng Lu
ADBIS
2003
Springer
108views Database» more  ADBIS 2003»
13 years 10 months ago
Evaluation of Common Counting Method for Concurrent Data Mining Queries
Data mining queries are often submitted concurrently to the data mining system. The data mining system should take advantage of overlapping of the mined datasets. In this paper we ...
Marek Wojciechowski, Maciej Zakrzewicz