Collaborative text categorization via exploiting sparse coefficients
- Publication Type:
- Journal Article
- Citation:
- World Wide Web, 2018, 21 (2), pp. 373 - 394
- Issue Date:
- 2018-03-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| 10.1007%2Fs11280-017-0460-2.pdf | Published Version | 1.11 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© 2017, Springer Science+Business Media New York. Text categorization is widely characterized as a multi-label classification problem. Robust modeling of the semantic similarity between a query text and training texts is essential to construct an effective and accurate classifier. In this paper, we systematically investigate the Web page/text classification problem via integrating sparse representation with random measurements. In particular, we first adopt a very sparse data-independent random measurement matrix to map the original high dimensional text feature space to a lower dimensional space without loss of key information. We then propose a generic sparse representation method to obtain the sparse solution by decoding the semantic correlations between the query text and entire training samples. Based on the above method, we also design and examine a series of rules by taking advantage of the sparse coefficients to propagate multiple labels for the given query texts. We have conducted extensive experiments using real-world datasets to examine our proposed approach, and the results show the effectiveness of the proposed approach.
Please use this identifier to cite or link to this item: