Sciweavers

1314 search results - page 145 / 263
» Approximate data mining in very large relational data
Sort
View
KDD
2002
ACM
170views Data Mining» more  KDD 2002»
16 years 2 months ago
Web site mining: a new way to spot competitors, customers and suppliers in the world wide web
When automatically extracting information from the world wide web, most established methods focus on spotting single HTMLdocuments. However, the problem of spotting complete web s...
Martin Ester, Hans-Peter Kriegel, Matthias Schuber...
WWW
2004
ACM
16 years 2 months ago
Mining anchor text for query refinement
When searching large hypertext document collections, it is often possible that there are too many results available for ambiguous queries. Query refinement is an interactive proce...
Reiner Kraft, Jason Y. Zien
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
16 years 2 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
JCB
2002
87views more  JCB 2002»
15 years 1 months ago
The Repetitive Sequence Database and Mining Putative Regulatory Elements in Gene Promoter Regions
At least 43% of the human genome is occupied by repetitive elements. Moreover, around 51% of the rice genome is occupied by repetitive elements. The analysis of repetitive element...
Jorng-Tzong Horng, Hsien-Da Huang, Ming-Hui Jin, L...
122
Voted
PAKDD
2000
ACM
128views Data Mining» more  PAKDD 2000»
15 years 5 months ago
A Comparative Study of Classification Based Personal E-mail Filtering
This paper addresses personal E-mail filtering by casting it in the framework of text classification. Modeled as semi-structured documents, Email messages consist of a set of field...
Yanlei Diao, Hongjun Lu, Dekai Wu