Sciweavers

216 search results - page 28 / 44
» Decision Tree with Better Ranking
Sort
View
WWW
2005
ACM
16 years 13 days ago
Boosting SVM classifiers by ensemble
By far, the support vector machines (SVM) achieve the state-of-theart performance for the text classification (TC) tasks. Due to the complexity of the TC problems, it becomes a ch...
Yan-Shi Dong, Ke-Song Han
ICCAD
2003
IEEE
111views Hardware» more  ICCAD 2003»
15 years 8 months ago
A Trade-off Oriented Placement Tool
High quality placement results are always produced at the cost of significant runtimes. In this paper, we study the trade-off between the overall quality and the runtime for stand...
Huaiyu Xu, Maogang Wang, Bo-Kyung Choi, Majid Sarr...
WFLP
2000
Springer
148views Algorithms» more  WFLP 2000»
15 years 3 months ago
The Use of Functional and Logic Languages in Machine Learning
Abstract. Traditionally, machine learning algorithms such as decision tree learners have employed attribute-value representations. From the early 80's on people have started t...
Peter A. Flach
ACL
2006
15 years 1 months ago
A Pipeline Framework for Dependency Parsing
Pipeline computation, in which a task is decomposed into several stages that are solved sequentially, is a common computational strategy in natural language processing. The key pr...
Ming-Wei Chang, Quang Do, Dan Roth
AAAI
1996
15 years 1 months ago
Bagging, Boosting, and C4.5
Breiman's bagging and Freund and Schapire's boosting are recent methods for improving the predictive power of classi er learning systems. Both form a set of classi ers t...
J. Ross Quinlan