A kernel-based framework for learning graded relations from data
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2011
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910674570969088 |
|---|---|
| author | Waegeman, Willem Pahikkala, Tapio Airola, Antti Salakoski, Tapio Stock, Michiel De Baets, Bernard |
| author_facet | Waegeman, Willem Pahikkala, Tapio Airola, Antti Salakoski, Tapio Stock, Michiel De Baets, Bernard |
| contents | Driven by a large number of potential applications in areas like bioinformatics, information retrieval and social network analysis, the problem setting of inferring relations between pairs of data objects has recently been investigated quite intensively in the machine learning community. To this end, current approaches typically consider datasets containing crisp relations, so that standard classification methods can be adopted. However, relations between objects like similarities and preferences are often expressed in a graded manner in real-world applications. A general kernel-based framework for learning relations from data is introduced here. It extends existing approaches because both crisp and graded relations are considered, and it unifies existing approaches because different types of graded relations can be modeled, including symmetric and reciprocal relations. This framework establishes important links between recent developments in fuzzy set theory and machine learning. Its usefulness is demonstrated through various experiments on synthetic and real-world data. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1111_6473 |
| institution | arXiv |
| publishDate | 2011 |
| record_format | arxiv |
| spellingShingle | A kernel-based framework for learning graded relations from data Waegeman, Willem Pahikkala, Tapio Airola, Antti Salakoski, Tapio Stock, Michiel De Baets, Bernard Machine Learning Driven by a large number of potential applications in areas like bioinformatics, information retrieval and social network analysis, the problem setting of inferring relations between pairs of data objects has recently been investigated quite intensively in the machine learning community. To this end, current approaches typically consider datasets containing crisp relations, so that standard classification methods can be adopted. However, relations between objects like similarities and preferences are often expressed in a graded manner in real-world applications. A general kernel-based framework for learning relations from data is introduced here. It extends existing approaches because both crisp and graded relations are considered, and it unifies existing approaches because different types of graded relations can be modeled, including symmetric and reciprocal relations. This framework establishes important links between recent developments in fuzzy set theory and machine learning. Its usefulness is demonstrated through various experiments on synthetic and real-world data. |
| title | A kernel-based framework for learning graded relations from data |
| topic | Machine Learning |
| url | https://arxiv.org/abs/1111.6473 |