FOLD-TR: A Scalable and Efficient Inductive Learning Algorithm for Learning To Rank
FOLD-R++ is a new inductive learning algorithm for binary classification tasks. It generates an (explainable) normal logic program for mixed type (numerical and categorical) data. We present a customized FOLD-R++ algorithm with the ranking framework, called FOLD-TR, that aims to rank new items following the ranking pattern in the training data. Like FOLD-R++, the FOLD-TR algorithm is able to handle mixed-type data directly and provide native justification to explain the comparison between a pair of items.
Code (0)
등록된 구현이 없습니다.
Tasks
Binary ClassificationInductive LearningLearning-To-RankVocal Bursts Type PredictionSimilar Papers 제목 키워드 기반
FOLD-RM: A Scalable, Efficient, and Explainable Inductive Learning Algorithm for Multi-Category Classification of Mixed Data
FOLD-RM is an automated inductive learning algorithm for learning default rules for mixed (numerical and categorical) data. It generates an (explainable) answer set programming (ASP) rule set for multi-category classific…
Inductive LearningFOLD-R++: A Scalable Toolset for Automated Inductive Learning of Default Theories from Mixed Data
FOLD-R is an automated inductive learning algorithm for learning default rules for mixed (numerical and categorical) data. It generates an (explainable) answer set programming (ASP) rule set for classification tasks. We …
feature selectionInductive LearningA Riemannian gossip approach to decentralized matrix completion
In this paper, we propose novel gossip algorithms for the low-rank decentralized matrix completion problem. The proposed approach is on the Riemannian Grassmann manifold that allows local matrix completion by different a…
Matrix CompletionFOLD-R++: A Toolset for Automated Inductive Learning of Default Theories from Mixed Data
FOLD-R is an automated inductive learning algorithm for learning default rules with exceptions for mixed (numerical and categorical) data. It generates an (explainable) answer set programming (ASP) rule set for classific…
feature selectionInductive LearningA Clustering and Demotion Based Algorithm for Inductive Learning of Default Theories
We present a clustering- and demotion-based algorithm called Kmeans-FOLD to induce nonmonotonic logic programs from positive and negative examples. Our algorithm improves upon-and is inspired by-the FOLD algorithm. The F…
ClusteringInductive LearningInductive logic programming