Sciweavers

4085 search results - page 257 / 817
» Benchmarking Data Mining Algorithms
Sort
View
ADMA
2009
Springer
142views Data Mining» more  ADMA 2009»
15 years 10 months ago
Crawling Deep Web Using a New Set Covering Algorithm
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...
Yan Wang, Jianguo Lu, Jessica Chen
KDD
1997
ACM
114views Data Mining» more  KDD 1997»
15 years 8 months ago
Schema Discovery for Semistructured Data
To formulate a meaningful query on semistructured data, such as on the Web, that matches some of the source’s structure, we need first to discover something about how the infor...
Ke Wang, Huiqing Liu
FIMI
2003
120views Data Mining» more  FIMI 2003»
15 years 5 months ago
MAFIA: A Performance Study of Mining Maximal Frequent Itemsets
We present a performance study of the MAFIA algorithm for mining maximal frequent itemsets from a transactional database. In a thorough experimental analysis, we isolate the effec...
Douglas Burdick, Manuel Calimlim, Jason Flannick, ...
DMIN
2009
136views Data Mining» more  DMIN 2009»
15 years 1 months ago
Evaluating Algorithms for Concept Description
When performing concept description, models need to be evaluated both on accuracy and comprehensibility. A comprehensible concept description model should present the most importan...
Cecilia Sönströd, Ulf Johansson, Tuve L&...
SAC
2004
ACM
15 years 9 months ago
Frequent free tree discovery in graph data
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground betw...
Ulrich Rückert, Stefan Kramer