A peer-to-peer hypertext categorization using directed acyclic graph support vector machines

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

DAGSVM (Directed Acyclic Graph Support Vector Machines) has met with a significant success in information retrieval field, especially handling text classification tasks. This paper presents PDHCS (P2P-based Distributed Hypertext Categorization System) that classify hypertext in Peer-to-Peer networks. Distributed hypertext categorization can be easily implemented in PDHCS by combining the DAGSVM (Directed Acyclic Graph Support Vector Machines) learning architecture and Chord overlay network. Knowledge sharing among the distributed learning machines is achieved via utilizing both the special features of the DAG learning architecture and the advantages of support vector machines. The parallel structure of DAGSVM, the special features of support vector machines and decentralization of Chord overlay network lead to PDHCS being more efficient.

Cite

CITATION STYLE

APA

Fei, L., Wen-Ju, Z., Shui, Y., Fan-Yuan, M., & Ming-Lu, L. (2004). A peer-to-peer hypertext categorization using directed acyclic graph support vector machines. In Lecture Notes in Computer Science (Vol. 3320, pp. 54–57). Springer Verlag. https://doi.org/10.1007/978-3-540-30501-9_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free