A Classification Paradigm for Distributed Vertically Partitioned Data

DOI10.1162/089976604323057470MaRDI QIDQ4832499zbMATH OpenOpenAlexWikidataFDO

Authors Jayanta Basak, Ravi Kothari

Publication date 4 January 2005

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1162/089976604323057470

zbMATH Keywords

pattern classification algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• Learning k-nearest neighbors classifier from distributed data
• Distributed prediction from vertically partitioned data
• Decomposable Naive Bayes classifier for partitioned data
• A Framework for Learning from Distributed Data Using Sufficient Statistics and Its Application to Learning Decision Trees
• Distributed data classification in sensor networks

Cites work

• Universal approximation bounds for superpositions of a sigmoidal function

Cited in

(5)

• A novel multi-view learning developed from single-view patterns
• Transductive Methods for the Distributed Ensemble Classification Problem
• Distributed prediction from vertically partitioned data
• Decomposable Naive Bayes classifier for partitioned data
• Decision aggregation in distributed classification by a transductive extension of maximum entropy/improved iterative scaling

This page was built for publication: A Classification Paradigm for Distributed Vertically Partitioned Data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4832499)