Search Results for author: Phillip Odom

Found 6 papers, 2 papers with code

Knowledge-based Refinement of Scientific Publication Knowledge Graphs

no code implementations10 Sep 2023 Siwen Yan, Phillip Odom, Sriraam Natarajan

We consider the problem of identifying authorship by posing it as a knowledge graph construction and refinement.

graph construction Knowledge Graphs +1

User Friendly Automatic Construction of Background Knowledge: Mode Construction from ER Diagrams

1 code implementation16 Dec 2019 Alexander L. Hayes, Mayukh Das, Phillip Odom, Sriraam Natarajan

One of the key advantages of Inductive Logic Programming systems is the ability of the domain experts to provide background knowledge as modes that allow for efficient search through the space of hypotheses.

Inductive logic programming

Multi-class Classification without Multi-class Labels

1 code implementation ICLR 2019 Yen-Chang Hsu, Zhaoyang Lv, Joel Schlosser, Phillip Odom, Zsolt Kira

This work presents a new strategy for multi-class classification that requires no class-specific labels, but instead leverages pairwise similarity between examples, which is a weaker form of annotation.

Classification General Classification +1

A probabilistic constrained clustering for transfer learning and image category discovery

no code implementations28 Jun 2018 Yen-Chang Hsu, Zhaoyang Lv, Joel Schlosser, Phillip Odom, Zsolt Kira

The proposed objective directly minimizes the negative log-likelihood of cluster assignment with respect to the pairwise constraints, has no hyper-parameters, and demonstrates improved scalability and performance on both supervised learning and unsupervised transfer learning.

Constrained Clustering Deep Clustering +2

Preference-Guided Planning: An Active Elicitation Approach

no code implementations19 Apr 2018 Mayukh Das, Phillip Odom, Md. Rakibul Islam, Janardhan Rao, Doppa, Dan Roth, Sriraam Natarajan

Planning with preferences has been employed extensively to quickly generate high-quality plans.

Cannot find the paper you are looking for? You can Submit a new open access paper.