Sciweavers

3050 search results - page 245 / 610
» On-line Algorithms in Machine Learning
Sort
View
ICMLA
2009
15 years 2 months ago
All-Monotony: A Generalization of the All-Confidence Antimonotony
Abstract--Many studies have shown the limits of support/confidence framework used in Apriori-like algorithms to mine association rules. One solution to cope with this limitation is...
Yannick Le Bras, Philippe Lenca, Sorin Moga, St&ea...
ICML
2007
IEEE
16 years 5 months ago
On learning linear ranking functions for beam search
Beam search is used to maintain tractability in large search spaces at the expense of completeness and optimality. We study supervised learning of linear ranking functions for con...
Yuehua Xu, Alan Fern
KDD
2007
ACM
149views Data Mining» more  KDD 2007»
16 years 4 months ago
Partial example acquisition in cost-sensitive learning
It is often expensive to acquire data in real-world data mining applications. Most previous data mining and machine learning research, however, assumes that a fixed set of trainin...
Victor S. Sheng, Charles X. Ling
ALT
2002
Springer
16 years 1 months ago
The Complexity of Learning Concept Classes with Polynomial General Dimension
The general dimension is a combinatorial measure that characterizes the number of queries needed to learn a concept class. We use this notion to show that any p-evaluatable concep...
Johannes Köbler, Wolfgang Lindner
CCS
2009
ACM
15 years 11 months ago
Active learning for network intrusion detection
Anomaly detection for network intrusion detection is usually considered an unsupervised task. Prominent techniques, such as one-class support vector machines, learn a hypersphere ...
Nico Görnitz, Marius Kloft, Konrad Rieck, Ulf...