Label Ranking with Semi-Supervised Learning

نویسندگان

  • Wei Wang
  • Irwin King
چکیده

Label ranking is considered as an efficient approach for object recognition, document classification, recommendation task, which has been widely studied in recent years. It aims to learn a mapping from instances to a ranking list over a finite set of predefined labels. Traditional solutions for label rankings cannot obtain satisfactory results by only utilizing labeled data and ignore large amount of unlabeled data. This paper introduces a novel Semi-Supervised Learning (SSL) framework by exploiting unlabeled data to improve the performance. Under this framework, we also propose a new Information Gain Decision Tree(IGDT) with aims to make full use of latent information and as such raise the efficiency and accuracy. Then we outline our models involving another two algorithms, Instance Based Learning (IBL) and Mallows Model Decision Tree (MMDT) within this framework. Experiment results demonstrate our approaches can obtain a better performance comparing with only applying labeled data.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Video semantic analysis based on structure-sensitive anisotropic manifold ranking

As a major family of semi-supervised learning (SSL), graph-based SSL has recently attracted considerable interest in the machine learning community along with application areas such as video semantic analysis. In this paper, we analyze the connections between graph-based SSL and partial differential equation(PDE) based diffusion. From the viewpoint of PDE-based diffusion, the label propagation ...

متن کامل

Ranking and Semi-supervised Classification on Large Scale Graphs Using Map-Reduce

Label Propagation, a standard algorithm for semi-supervised classification, suffers from scalability issues involving memory and computation when used with largescale graphs from real-world datasets. In this paper we approach Label Propagation as solution to a system of linear equations which can be implemented as a scalable parallel algorithm using the map-reduce framework. In addition to semi...

متن کامل

MSRA-USTC-SJTU at TRECVID 2007: High-Level Feature Extraction and Search

This paper describes the MSRA-USTC-SJTU experiments for TRECVID 2007. We performed the experiments in high-level feature extraction and automatic search tasks. For high-level feature extraction, we investigated the benefit of unlabeled data by semi-supervised learning, and the multi-layer (ML) multi-instance (MI) relation embedded in video by MLMI kernel, as well as the correlations between con...

متن کامل

Estimating Maximally Probable Constrained Relations by Mathematical Programming

Estimating a constrained relation is a fundamental problem in machine learning. Special cases are classification (the problem of estimating a map from a set of to-be-classified elements to a set of labels), clustering (the problem of estimating an equivalence relation on a set) and ranking (the problem of estimating a linear order on a set). We contribute a family of probability measures on the...

متن کامل

Information Retrieval Using Label Propagation Based Ranking

The IR group participated in the crosslanguage retrieval task (CLIR) at the sixth NTCIR workshop (NTCIR 6). In this paper, we describe our approach on Chinese Single Language Information Retrieval (SLIR) task and English-Chinese Bilingual CLIR task (BLIR). We use both bi-grams and single Chinese characters as index units and use OKAPI BM25 as retrieval model. The initial retrieved documents are...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Austr. J. Intelligent Information Processing Systems

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2010