A Kernel-Based Framework for Learning Graded Relations From Data



: Waegeman W, Pahikkala T, Airola A, Salakoski T, Stock M, De Baets B

Publisher: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC

: 2012

: IEEE Transactions on Fuzzy Systems

: IEEE TRANSACTIONS ON FUZZY SYSTEMS

: IEEE T FUZZY SYST

: 6

: 20

: 6

: 1090

: 1101

: 12

: 1063-6706

DOI: https://doi.org/10.1109/TFUZZ.2012.2194151

: https://research.utu.fi/converis/portal/detail/Publication/1319928


Driven by a large number of potential applications in areas, such as bioinformatics, information retrieval, and social network analysis, the problem setting of inferring relations between pairs of data objects has recently been investigated 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. The results indicate that incorporating domain knowledge about relations improves the predictive performance.

Last updated on 2024-26-11 at 17:59