Sciweavers

4085 search results - page 100 / 817
» Benchmarking Data Mining Algorithms
Sort
View
AUSAI
2007
Springer
14 years 4 months ago
Merging Algorithm to Reduce Dimensionality in Application to Web-Mining
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
Vladimir Nikulin, Geoffrey J. McLachlan
KDD
2003
ACM
156views Data Mining» more  KDD 2003»
14 years 10 months ago
Fast vertical mining using diffsets
A number of vertical mining algorithms have been proposed recently for association mining, which have shown to be very effective and usually outperform horizontal approaches. The ...
Mohammed Javeed Zaki, Karam Gouda
SDM
2008
SIAM
147views Data Mining» more  SDM 2008»
13 years 11 months ago
The Asymmetric Approximate Anytime Join: A New Primitive with Applications to Data Mining
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
Lexiang Ye, Xiaoyue Wang, Dragomir Yankov, Eamonn ...
AUSDM
2007
Springer
84views Data Mining» more  AUSDM 2007»
14 years 4 months ago
Detecting Anomalous Longitudinal Associations Through Higher Order Mining
The detection of unusual or anomalous data is an important function in automated data analysis or data mining. However, the diversity of anomaly detection algorithms shows that it...
Ping Liang, John F. Roddick
ICDM
2007
IEEE
109views Data Mining» more  ICDM 2007»
14 years 4 months ago
Language-Independent Set Expansion of Named Entities Using the Web
Set expansion refers to expanding a given partial set of objects into a more complete set. A well-known example system that does set expansion using the web is Google Sets. In thi...
Richard C. Wang, William W. Cohen