نتایج جستجو برای: SVM

تعداد نتایج: 21884  

1999
Debapriya Sengupta Sujit Kumar Ghosh

The purpose of this article is to introduce a new scheme for robust multivariate ranking by making use of a not so familiar notion called monotonicity. Under this scheme, as in the case of classical outward ranking, we get an increasing sequence of regions diverging away from a central region (may be a single point) as nucleus. The nuclear region may be deened as the median region.

2015
Ramon Ziai Björn Rudzewitz

This paper describes our contribution to the English Entrance Exams task of CLEF 2015, which requires participating systems to automatically solve multiple choice reading comprehension tasks. We use a combination of text segmentation and different similarity measures with the aim of exploiting two observed aspects of tests: 1) the often linear relationship between reading text and test question...

2015

Using Yelp data, we built a restaurant recommendation system for individuals and groups. For each of 4.9k individual Yelp users, we create a ranking SVM model with features encompassing users’ food preferences and dietary restrictions, such as cuisine type, services o↵ered, ambience, noise level, average rating, etc. Our recommendation system for individual users achieved 72% average prediction...

2016
Jaebok Kim Khiet P. Truong Vicky Charisi Cristina Zaga Vanessa Evers Mohamed Chetouani

In collaborative play, children exhibit different levels of engagement. Some children are engaged with other children while some play alone. In this study, we investigated multimodal detection of individual levels of engagement using a ranking method and non-verbal features: turn-taking and body movement. Firstly, we automatically extracted turn-taking and body movement features in naturalistic...

ژورنال: :فصلنامه علمی- پژوهشی آب و فاضلاب 2011
روح اله نوری امیر خاکپور مجید دهقانی اشکان فرخ نیا

هدف اصلی این تحقیق بررسی تأثیر انتخاب متغیرهای ورودی با استفاده از آنالیز مؤلفه اصلی (pca) بر عملکرد مدل ماشین بردار پشتیبان (svm) برای پیش بینی ماهانه دبی رودخانه بود. به این منظور ابتدا با استفاده از 18 متغیر ورودی به مدل svm، دبی جریان ماهانه پیش بینی شد. سپس با استفاده از pca تعداد متغیرهای ورودی به مدل svm از 18 متغیر به 5 مؤلفه کاهش یافت. در نهایت با استفاده از آماره توسعه یافته توسط نویس...

2010
Kien-Tsoi T. E. Tjin-Kam-Jet Djoerd Hiemstra

Merging search results from different servers is a major problem in Distributed Information Retrieval. We used Regression-SVM and Ranking-SVM which would learn a function that merges results based on information that is readily available: i.e. the ranks, titles, summaries and URLs contained in the results pages. By not downloading additional information, such as the full document, we decrease b...

2007
Jizhou Huang Ming Zhou Dan Yang

This paper presents a novel approach for extracting high-quality pairs as chat knowledge from online discussion forums so as to efficiently support the construction of a chatbot for a certain domain. Given a forum, the high-quality pairs are extracted using a cascaded framework. First, the replies logically relevant to the thread title of the root mes...

2004
Michel Truchon

We scrutinize and compare, from the perspective of modern theory of social choice, two rules that have been used to rank competitors in Figure Skating for the past decades. The first rule has been in use at least from 1982 until 1998, when it was replaced by a new one. We also compare these two rules with the Borda and the Kemeny rules. The four rules are illustrated with examples and with the ...

2009
Yunsong Guo Carla P. Gomes

We propose an approach for automatically ranking structured documents applied to patent prior art search. Our model, SVM Patent Ranking (SVMPR) incorporates margin constraints that directly capture the specificities of patent citation ranking. Our approach combines patent domain knowledge features with meta-score features from several different general Information Retrieval methods. The trainin...

2010
Weiwei Cheng Krzysztof Dembczynski Eyke Hüllermeier

This paper introduces two new methods for label ranking based on a probabilistic model of ranking data, called the Plackett-Luce model. The idea of the first method is to use the PL model to fit locally constant probability models in the context of instance-based learning. As opposed to this, the second method estimates a global model in which the PL parameters are represented as functions of t...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید