Skip to main navigation Skip to search Skip to main content

Critical vector learning for text categorisation

  • University of Technology Sydney

Research output: Chapter in Book / Conference PaperConference Paperpeer-review

Abstract

This paper proposes a new text categorisation method based on the critical vector learning algorithm. By implementing a Bayesian treatment of a generalised linear model of identical function form to the support vector machine, the proposed approach requires signi-cantly fewer support vectors. This leads to much reduced computational com- plexity of the prediction process, which is critical in online applications.

Original languageEnglish
Title of host publicationAusDM 2005 Proc. - 4th Australasian Data Mining Conf. - Collocated with the 18th Australian Joint Conf. on Artificial Intelligence, AI 2005 and the 2nd Australian Conf. on Artificial Life, ACAL 2005
Pages27-35
Number of pages9
Publication statusPublished - 2005
Externally publishedYes
Event4th Australasian Data Mining Conference, AusDM 2005 - Collocated with the 18th Australian Joint Conference on Artificial Intelligence, AI 2005 and the 2nd Australian Conference on Artificial Life, ACAL 2005 - Sydney, NSW, Australia
Duration: 5 Dec 20056 Dec 2005

Publication series

NameAusDM 2005 Proc. - 4th Australasian Data Mining Conf. - Collocated with the 18th Australian Joint Conf. on Artificial Intelligence, AI 2005 and the 2nd Australian Conf. on Artifical Life, ACAL 2005

Conference

Conference4th Australasian Data Mining Conference, AusDM 2005 - Collocated with the 18th Australian Joint Conference on Artificial Intelligence, AI 2005 and the 2nd Australian Conference on Artificial Life, ACAL 2005
Country/TerritoryAustralia
CitySydney, NSW
Period5/12/056/12/05

Keywords

  • Critical vector learning
  • Relevance vector machine
  • Support vector machine
  • Text Classi cation

Fingerprint

Dive into the research topics of 'Critical vector learning for text categorisation'. Together they form a unique fingerprint.

Cite this