Sciweavers

330 search results - page 20 / 66
» Learning Concept Importance Using a Weighted Dependence Mode...
Sort
View
KDD
1995
ACM
135views Data Mining» more  KDD 1995»
13 years 11 months ago
Rough Sets Similarity-Based Learning from Databases
Manydata mining algorithms developed recently are based on inductive learning methods. Very few are based on similarity-based learning. However, similarity-based learning accrues ...
Xiaohua Hu, Nick Cercone
COMAD
2009
13 years 8 months ago
Categorizing Concepts for Detecting Drifts in Stream
Mining evolving data streams for concept drifts has gained importance in applications like customer behavior analysis, network intrusion detection, credit card fraud detection. Se...
Sharanjit Kaur, Vasudha Bhatnagar, Sameep Mehta, S...
JETAI
1998
110views more  JETAI 1998»
13 years 7 months ago
Independency relationships and learning algorithms for singly connected networks
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e cientl...
Luis M. de Campos
ICS
2010
Tsinghua U.
14 years 10 days ago
Handling task dependencies under strided and aliased references
The emergence of multicore processors has increased the need for simple parallel programming models usable by nonexperts. The ability to specify subparts of a bigger data structur...
Josep M. Pérez, Rosa M. Badia, Jesús...
ICML
2006
IEEE
14 years 8 months ago
Nightmare at test time: robust learning by feature deletion
When constructing a classifier from labeled data, it is important not to assign too much weight to any single input feature, in order to increase the robustness of the classifier....
Amir Globerson, Sam T. Roweis