Approximating web communities using subspace decomposition
| dc.creator | Eustace, Justine | |
| dc.creator | Wang, Xingyuan | |
| dc.creator | Li, Junqiu | |
| dc.date | 2021-05-05T09:57:28Z | |
| dc.date | 2021-05-05T09:57:28Z | |
| dc.date | 2014 | |
| dc.date.accessioned | 2022-10-20T13:47:42Z | |
| dc.date.available | 2022-10-20T13:47:42Z | |
| dc.description | Abstract. Full article available at https://doi.org/10.1016/j.knosys.2014.06.017 | |
| dc.description | Herein, we propose an algorithm to approximate web communities from the topic related web pages. The approximation is achieved by subspace factorization of the topic related web pages. The factorization process reveals existing association between web pages such that the closely related web pages are extracted. We vary the approximation values to identify varied degrees of relationship between web pages. Experiments on real data sets show that the proposed algorithm reduces the impact of unrelated links and therefore can be used to control spam links in web pages. | |
| dc.identifier | Eustace, J., Wang, X., & Li, J. (2014). Approximating web communities using subspace decomposition. Knowledge-Based Systems, 70, 118-127. | |
| dc.identifier | DOI: 10.1016/j.knosys.2014.06.017 | |
| dc.identifier | http://hdl.handle.net/20.500.12661/2946 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.12661/2946 | |
| dc.language | en | |
| dc.publisher | Elsevier | |
| dc.subject | Algorithm | |
| dc.subject | Web pages | |
| dc.subject | Web communities | |
| dc.subject | Web graphs | |
| dc.subject | Subspace decomposition | |
| dc.subject | Information retrieval | |
| dc.subject | Community detection | |
| dc.subject | Spam detection | |
| dc.title | Approximating web communities using subspace decomposition | |
| dc.type | Article |