OpenAlex 352 eser 10 yazar konusu
Çalışmalar
352 eser
-
OpenAlex üst %1
OpenAlex 99.8%
International audience
-
OpenAlex üst %10
OpenAlex 98.6%
This paper is concerned with the class imbalance problem which has been known to hinder the learning performance of classification algorithms. The problem occurs when there are significantly less number of observations of the target concept. Various real-world classification tasks, such as medical diagnosis, text cate…
-
YÖKSİS
SJR Q1
JCR Q1
OpenAlex üst %1
OpenAlex 99.8%
Özet henüz yok.
-
We consider the problem of evaluating retrieval systems using incomplete judgment information. Buckley and Voorhees recently demonstrated that retrieval systems can be efficiently and effectively evaluated using incomplete judgments via the bpref measure [6]. When relevance judgments are complete, the value of bpref i…
-
SJR Q1
JCR Q1
OpenAlex üst %1
OpenAlex 99.4%
A fundamental question in information theory and in computer science is how to measure similarity or the amount of shared information between two sequences. We have proposed a metric, based on Kolmogorov complexity, to answer this question and have proven it to be universal. We apply this metric in measuring the amoun…
-
OpenAlex üst %10
OpenAlex 98.9%
We consider the problem of large scale retrieval evaluation. Recently two methods based on random sampling were proposed as a solution to the extensive effort required to judge tens of thousands of documents. While the first method proposed by Aslam et al. [1] is quite accurate and efficient, it is overly complex, mak…
-
OpenAlex üst %1
OpenAlex 99.4%
We consider the problem of large-scale retrieval evaluation, and we propose a statistical method for evaluating retrieval systems using incomplete judgments. Unlike existing techniques that (1) rely on effectively complete, and thus prohibitively expensive, relevance judgment sets, (2) produce biased estimates of stan…
-
OpenAlex üst %10
OpenAlex 96.6%
The class imbalance problem has been known to hinder the learning performance of classification algorithms. Various real-world classification tasks such as text categorization suffer from this phenomenon. We demonstrate that active learning is capable of solving the problem.
-
YÖKSİS
SJR Q1
JCR Q1
OpenAlex üst %10
OpenAlex 97.9%
In this paper, we propose a nonconvex online Support Vector Machine (SVM) algorithm (LASVM-NC) based on the Ramp Loss, which has the strong ability of suppressing the influence of outliers. Then, again in the online learning setting, we propose an outlier filtering mechanism (LASVM-I) based on approximating nonconvex…
-
OpenAlex üst %10
OpenAlex 97.8%
Evaluation metrics play a critical role both in the context of comparative evaluation of the performance of retrieval systems and in the context of learning-to-rank (LTR) as objective functions to be optimized. Many different evaluation metrics have been proposed in the IR literature, with average precision (AP) being…
-
YÖKSİS
SJR Q2
JCR Q3
OpenAlex 88.7%
Özet henüz yok.
-
OpenAlex üst %10
OpenAlex 95.8%
This paper considers the problem of piecewise linear prediction from a competitive algorithm approach. In prior work, prediction algorithms have been developed that are "universal" with respect to the class of all linear predictors, such that they perform nearly as well, in terms of total squared prediction error, as…
Akademisyenler
10 akademisyen
- CEM TEKİN 26 yazar konusu
- AHMET CELAL CEM SAY 24 yazar konusu
- HÜSNÜ YENİGÜN 14 yazar konusu
- ŞEYDA ERTEKİN BOLELLİ 11 yazar konusu
- TONGUÇ ÜNLÜYURT 11 yazar konusu
- DORUK ÖNER 4 yazar konusu
- DURDANE ÇAĞLAR 2 yazar konusu
- MEHMET KAPLAN 2 yazar konusu
- MÜGE ACAR 2 yazar konusu
- RUŞEN MEYLANİ 1 yazar konusu