Sciweavers

2363 search results - page 310 / 473
» Learning Algorithms for Domain Adaptation
Sort
View
90
Voted
EMNLP
2007
15 years 2 months ago
Structured Prediction Models via the Matrix-Tree Theorem
This paper provides an algorithmic framework for learning statistical models involving directed spanning trees, or equivalently non-projective dependency structures. We show how p...
Terry Koo, Amir Globerson, Xavier Carreras, Michae...
EVOW
2008
Springer
15 years 2 months ago
A Hybrid Random Subspace Classifier Fusion Approach for Protein Mass Spectra Classification
Classifier fusion strategies have shown great potential to enhance the performance of pattern recognition systems. There is an agreement among researchers in classifier combination...
Amin Assareh, Mohammad Hassan Moradi, L. Gwenn Vol...
CIKM
2000
Springer
15 years 4 months ago
Boosting for Document Routing
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
Raj D. Iyer, David D. Lewis, Robert E. Schapire, Y...
103
Voted
BPM
2009
Springer
116views Business» more  BPM 2009»
15 years 7 months ago
Discovering Reference Models by Mining Process Variants Using a Heuristic Approach
Abstract. Recently, a new generation of adaptive Process-Aware Information Systems (PAISs) has emerged, which enables structural process changes during runtime. Such flexibility, ...
Chen Li, Manfred Reichert, Andreas Wombacher
115
Voted
AOSD
2007
ACM
15 years 4 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen