Sciweavers

1314 search results - page 119 / 263
» Approximate data mining in very large relational data
Sort
View
108
Voted
IJCNN
2007
IEEE
15 years 8 months ago
Agnostic Learning vs. Prior Knowledge Challenge
We organized a challenge for IJCNN 2007 to assess the added value of prior domain knowledge in machine learning. Most commercial data mining programs accept data pre-formatted in ...
Isabelle Guyon, Amir Saffari, Gideon Dror, Gavin C...
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
15 years 6 days ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang
ICANN
2001
Springer
15 years 6 months ago
Scalable Kernel Systems
Kernel-based systems are currently very popular approaches to supervised learning. Unfortunately, the computational load for training kernel-based systems increases drastically wit...
Volker Tresp, Anton Schwaighofer
SDM
2012
SIAM
237views Data Mining» more  SDM 2012»
13 years 4 months ago
A Distributed Kernel Summation Framework for General-Dimension Machine Learning
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
Dongryeol Lee, Richard W. Vuduc, Alexander G. Gray
KDD
1998
ACM
102views Data Mining» more  KDD 1998»
15 years 6 months ago
Joins that Generalize: Text Classification Using WHIRL
WHIRL is an extensionof relational databasesthat canperform "soft joins" basedon the similarity of textual identifiers;thesesoftjoins extendthe traditional operationof j...
William W. Cohen, Haym Hirsh