Effect of Incomplete Meta-dataset on Average Ranking Method
One of the simplest metalearning methods is the average ranking method. This method uses metadata in the form of test results of a given set of algorithms on given set of datasets and calculates an average rank for each algorithm. The ranks are used to construct the average ranking. We investigate the problem of how the process of generating the average ranking is affected by incomplete metadata including fewer test results. This issue is relevant, because if we could show that incomplete metadata does not affect the final results much, we could explore it in future design. We could simply conduct fewer tests and save thus computation time. In this paper we describe an upgraded average ranking method that is capable of dealing with incomplete metadata. Our results show that the proposed method is relatively robust to omission in test results in the meta datasets.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
KG-EDAS: A Meta-Metric Framework for Evaluating Knowledge Graph Completion Models
Knowledge Graphs (KGs) enable applications in various domains such as semantic search, recommendation systems, and natural language processing. KGs are often incomplete, missing entities and relations, an issue addressed…
Knowledge Graph CompletionRecommendation SystemsKnowledge GraphsRecommender Systems Algorithm Selection for Ranking Prediction on Implicit Feedback Datasets
The recommender systems algorithm selection problem for ranking prediction on implicit feedback datasets is under-explored. Traditional approaches in recommender systems algorithm selection focus predominantly on rating …
Recommendation SystemsMultiagent Evaluation under Incomplete Information
This paper investigates the evaluation of learned multiagent strategies in the incomplete information setting, which plays a critical role in ranking and training of agents. Traditionally, researchers have relied on Elo …
Incorporating Explicit Knowledge in Pre-trained Language Models for Passage Re-ranking
Passage re-ranking is to obtain a permutation over the candidate passage set from retrieval stage. Re-rankers have been boomed by Pre-trained Language Models (PLMs) due to their overwhelming advantages in natural languag…
Graph Neural NetworkNatural Language UnderstandingPassage Re-RankingRe-Ranking+1MGML: A Plug-and-Play Meta-Guided Multi-Modal Learning Framework for Incomplete Multimodal Brain Tumor Segmentation
Leveraging multimodal information from Magnetic Resonance Imaging (MRI) plays a vital role in lesion segmentation, especially for brain tumors. However, in clinical practice, multimodal MRI data are often incomplete, mak…
Brain Tumor SegmentationLesion Segmentation