Sciweavers

352 search results - page 42 / 71
» A Fast Decision Tree Learning Algorithm
Sort
View
ISCI
2008
124views more  ISCI 2008»
14 years 11 months ago
A weighted rough set based method developed for class imbalance learning
In this paper, we introduce weights into Pawlak rough set model to balance the class distribution of a data set and develop a weighted rough set based method to deal with the clas...
Jinfu Liu, Qinghua Hu, Daren Yu
82
Voted
ICML
1999
IEEE
15 years 12 months ago
Making Better Use of Global Discretization
Before applying learning algorithms to datasets, practitioners often globally discretize any numeric attributes. If the algorithm cannot handle numeric attributes directly, prior ...
Eibe Frank, Ian H. Witten
85
Voted
UAI
2000
15 years 11 days ago
The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data
This paper is about the use of metric data structures in high-dimensionalor non-Euclidean space to permit cached sufficientstatisticsaccelerationsof learning algorithms. It has re...
Andrew W. Moore
NAACL
2010
14 years 9 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad
DIS
2006
Springer
15 years 2 months ago
Incremental Algorithm Driven by Error Margins
Incremental learning is an approach to deal with the classification task when datasets are too large or when new examples can arrive at any time. One possible approach uses concent...
Gonzalo Ramos-Jiménez, José del Camp...