Titlebook: Machine Learning: ECML 2002; 13th European Confer Tapio Elomaa,Heikki Mannila,Hannu Toivonen Conference proceedings 2002 Springer-Verlag Be

商议

Improved Smoothing for Probabilistic Suffix Trees Seen as Variable Order Markov Chains the same model, namely a variable order Markov chain. We show a weakness of PST in terms of smoothing and propose to use an enhanced smoothing. We show that the model based on enhanced smoothing outperform the PST while needing less parameters on a protein domain detection task on public databases.

迎合

Collaborative Learning of Term-Based Concepts for Automatic Query Expansionad-hoc given query but the accuracy of adhoc document retrieval systems has plateaued in recent years. At DFKI, we are working on so-called collaborative information retrieval (CIR) systems which unintrusively learn from their users search processes. In this paper, a new approach is presented called

Optic-Disk

burnish

Reliable Classifications with Machine Learningerform domain experts (in terms of classification accuracy or otherwise), they are mostly not being used in practice. A plausible reason for this is that it is difficult to obtain an unbiased estimation of a .. In the paper we propose a general transductive method for estimation of classification’s

完成才会征服

Seminar

EWE

盟军

0302-9743 ased learning, reinforcement learning, multiagent learning, multirelational learning, Markov decision processes, active learning, etc.978-3-540-44036-9978-3-540-36755-0Series ISSN 0302-9743 Series E-ISSN 1611-3349

Engaged

护航舰

Collaborative Learning of Term-Based Concepts for Automatic Query Expansione retrieval effectiveness if measured the recall/precision in comparison to the standard vector space model and to the pseudo relevance feedback. This approach can be used to improve the retrieval of documents in Digital Libraries, in Document Management Systems, in the WWW etc.