Text categorization using compression models
| dc.contributor.author | Frank, Eibe | en_NZ |
| dc.contributor.author | Chui, Chang | en_NZ |
| dc.contributor.author | Witten, Ian H. | en_NZ |
| dc.contributor.editor | Storer, JA | en_NZ |
| dc.contributor.editor | Cohn, M | en_NZ |
| dc.coverage.spatial | Conference held at Snowbird, Utah | en_NZ |
| dc.date.accessioned | 2024-01-24T03:32:02Z | |
| dc.date.available | 2024-01-24T03:32:02Z | |
| dc.date.issued | 2000-03 | en_NZ |
| dc.description.abstract | Summary form only given. Test categorization is the assignment of natural language texts to predefined categories based on their concept. The use of predefined categories implies a "supervised learning" approach to categorization, where already-classified articles which effectively define the categories are used as "training data" to build a model that can be used for classifying new articles that comprise "the data". Typical approaches extract features from articles and use the feature vectors as input to a machine learning scheme that learns how to classify articles. The features are generally words. It has often been observed that compression seems to provide a very promising alternative approach to categorization. The overall compression of an article with respect to different models can be compared to see which one it fits most closely. Such a scheme has several potential advantages: it yields an overall judgement on the document as a whole, rather than discarding information by pre-selecting features it avoids the messy and rather artificial problem of defining word boundaries; it deals uniformly with morphological variants of words; depending on the model (and its order), it can take account of phrasal effects that span word boundaries; it offers a uniform way of dealing with different types of documents for example, arbitrary files in a computer system; it generally minimizes arbitrary decisions that inevitably need to be taken to render any learning scheme practical. | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.doi | 10.1109/DCC.2000.838202 | en_NZ |
| dc.identifier.uri | https://hdl.handle.net/10289/16390 | |
| dc.language.iso | en | |
| dc.publisher | IEEE | en_NZ |
| dc.relation.isPartOf | Proc Data Compression Conference | en_NZ |
| dc.rights | This is an author’s accepted version of a conference paper published in: Proc Data Compression Conference. © 2000 IEEE. | |
| dc.source | DCC 2000 | en_NZ |
| dc.title | Text categorization using compression models | en_NZ |
| dc.type | Conference Contribution | |
| dspace.entity.type | Publication | |
| pubs.begin-page | 555 | |
| pubs.end-page | 555 | |
| pubs.finish-date | 2000-03-30 | en_NZ |
| pubs.start-date | 2000-03-28 | en_NZ |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Frank_categorization.pdf
- Size:
- 23.29 KB
- Format:
- Adobe Portable Document Format
- Description:
- Accepted version
License bundle
1 - 1 of 1
Loading...
- Name:
- Research Commons Deposit Agreement 2017.pdf
- Size:
- 188.11 KB
- Format:
- Adobe Portable Document Format
- Description: