Sciweavers

489 search results - page 22 / 98
» Query Selectivity Estimation via Data Mining
Sort
View
SIGKDD
2000
106views more  SIGKDD 2000»
14 years 11 months ago
Data mining for hypertext: A tutorial survey
With over 800 million pages covering most areas of human endeavor, the World-wide Web is a fertile ground for data mining research to make a di erence to the e ectiveness of infor...
Soumen Chakrabarti
KDD
2012
ACM
281views Data Mining» more  KDD 2012»
13 years 2 months ago
Active spectral clustering via iterative uncertainty reduction
Spectral clustering is a widely used method for organizing data that only relies on pairwise similarity measurements. This makes its application to non-vectorial data straightforw...
Fabian L. Wauthier, Nebojsa Jojic, Michael I. Jord...
NECO
2002
78views more  NECO 2002»
14 years 11 months ago
Local Overfitting Control via Leverages
We present a novel approach to dealing with overfitting in black-box models. It is based on the leverages of the samples, i.e. on the influence that each observation has on the pa...
Gaétan Monari, Gérard Dreyfus
92
Voted
EDBT
2009
ACM
127views Database» more  EDBT 2009»
15 years 6 months ago
Approximate substring selectivity estimation
We study the problem of estimating selectivity of approximate substring queries. Its importance in databases is ever increasing as more and more data are input by users and are in...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
ADBIS
1999
Springer
104views Database» more  ADBIS 1999»
15 years 4 months ago
Mining Various Patterns in Sequential Data in an SQL-like Manner
Abstract. One of the most important data mining tasks is discovery of frequently occurring patterns in sequences of events. Many algorithms for finding various patterns in sequenti...
Marek Wojciechowski