نتایج جستجو برای: ranking path
تعداد نتایج: 173404 فیلتر نتایج به سال:
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...
This is an overview of the NTCIR-9 INTENT task, which comprises the Subtopic Mining and the Document Ranking subtasks. The INTENT task attracted participating teams from seven different countries/regions – 16 teams for Subtopic Mining and 8 teams for Document Ranking. The Subtopic Mining subtask received 42 Chinese runs and 14 Japanese runs; the Document Ranking subtask received 24 Chinese runs...
In this paper, we address the problem of ranking clinical documents using centrality based approach. We model the documents to be ranked as nodes in a graph and place edges between documents based on their similarity. Given a query, we compute similarity of the query with respect to every document in the graph. Based on these similarity values, documents are ranked for a given query. Initially,...
Due to the opportunities provided by the Internet, people are taking advantage of e-learning courses and during the last few years enormous research efforts have been dedicated to the development of e-learning systems. So far, many e-learning systems are proposed and used practically. However, in these systems the e-learning completion rate is low. One of the reasons is the low study desire and...
The aim of statistical relational learning is to learn statistical models from relational or graph-structured data. Three main statistical relational learning paradigms include weighted rule learning, random walks on graphs, and tensor factorization. These paradigms have been mostly developed and studied in isolation for many years, with few works attempting at understanding the relationship am...
This paper regards the query keywords selection problem in source retrieval as learning a ranking model to choose the method of keywords extraction over suspicious document segments. Four basic methods are used in our ranking function: BM25, TFIDF, TF and EW. Then, a ranking model based on Ranking SVM is proposed to rank the query keywords group which is contributed to get the higher evaluation...
Text readability is typically defined in terms of “grade level”; the expected educational level of the reader at which the text is directed. Mechanisms for measuring readability in English documents are well established; however this is not in case in many other languages, such as syllabic alphabetic languages. In this paper seven different mechanisms for assessing the readability of syllabic a...
پایان نامه موجود شامل چهار فصل می باشد، که به معرفی مسیر بحرانی و کاربرد آن در مدیریت زمان شبکه می پردازد. فصل اول شامل کلیات و مفاهیم مورد نیاز در طول فصل های بعدی می باشد و به بیان رگرسیون خطی ساده و چندگانه و تعاریف مقدماتی مجموعه فازی می پردازیم. تحلیل مسیر با استفاده از رگرسیون و روشی برای تشخیص مدل مناسب را در فصل دوم معرفی می کنیم. در فصل سوم به معرفی شبکه، مقادیر مورد نیاز برای تحلیل مس...
Aggregate ranking tasks are those where documents are not the final ranking outcome, but instead an intermediary component. For instance, in expert search, a ranking of candidate persons with relevant expertise to a query is generated after consideration of a document ranking. Many models exist for aggregate ranking tasks, however obtaining an effective and robust setting for different aggregat...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید