Gautam Kunapuli

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with David Poole 0001

> Home > Persons > Gautam Kunapuli

Publications

2021
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/datamine/RamananKKFK0KN21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/datamine/RamananKKFK0KN21
Nandini Ramanan, Gautam Kunapuli, Tushar Khot, Bahare Fatemi, Seyed Mehran Kazemi, David Poole, Kristian Kersting, Sriraam Natarajan:
Structure learning for relational logistic regression: an ensemble approach. Data Min. Knowl. Discov. 35(5): 2089-2111 (2021)
2018
[c17]
- view
  - electronic edition @ aaai.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/kr/RamananKKFK0KN18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/kr/RamananKKFK0KN18
Nandini Ramanan, Gautam Kunapuli, Tushar Khot, Bahare Fatemi, Seyed Mehran Kazemi, David Poole, Kristian Kersting, Sriraam Natarajan:
Structure Learning for Relational Logistic Regression: An Ensemble Approach. KR 2018: 661-662
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1808-02123
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1808-02123
Nandini Ramanan, Gautam Kunapuli, Tushar Khot, Bahare Fatemi, Seyed Mehran Kazemi, David Poole, Kristian Kersting, Sriraam Natarajan:
Structure Learning for Relational Logistic Regression: An Ensemble Approach. CoRR abs/1808.02123 (2018)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.