liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Towards scalable and data efficient learning of Markov boundaries
Linköping University, Department of Computer and Information Science, Database and information techniques. (ADIT)
Linköping University, The Institute of Technology. Linköping University, Department of Physics, Chemistry and Biology, Computational Biology.
Computional Medicine group KI.
Linköping University, The Institute of Technology. Linköping University, Department of Physics, Chemistry and Biology, Computational Biology.
2007 (English)In: International Journal of Approximate Reasoning, ISSN 0888-613X, E-ISSN 1873-4731, Vol. 45, no 2, 211-232 p.Article in journal (Refereed) Published
Abstract [en]

We propose algorithms for learning Markov boundaries from data without having to learn a Bayesian network first. We study their correctness, scalability and data efficiency. The last two properties are important because we aim to apply the algorithms to identify the minimal set of features that is needed for probabilistic classification in databases with thousands of features but few instances, e.g. gene expression databases. We evaluate the algorithms on synthetic and real databases, including one with 139,351 features. © 2006 Elsevier Inc. All rights reserved.

Place, publisher, year, edition, pages
2007. Vol. 45, no 2, 211-232 p.
National Category
Natural Sciences
Identifiers
URN: urn:nbn:se:liu:diva-38393DOI: 10.1016/j.ijar.2006.06.008Local ID: 44146OAI: oai:DiVA.org:liu-38393DiVA: diva2:259242
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2013-05-14

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Peña, Jose M.Nilsson, RolandTegnér, Jesper

Search in DiVA

By author/editor
Peña, Jose M.Nilsson, RolandTegnér, Jesper
By organisation
Database and information techniquesThe Institute of TechnologyComputational Biology
In the same journal
International Journal of Approximate Reasoning
Natural Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 91 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf