| dc.creator | AIREL PEREZ SUAREZ | |
| dc.creator | José Francisco Martínez Trinidad | |
| dc.creator | Jesús Ariel Carrasco Ochoa | |
| dc.creator | José Eladio Medina Pagola | |
| dc.date | 2013 | |
| dc.date.accessioned | 2023-07-25T16:25:30Z | |
| dc.date.available | 2023-07-25T16:25:30Z | |
| dc.identifier | http://inaoe.repositorioinstitucional.mx/jspui/handle/1009/2388 | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/7807563 | |
| dc.description | Clustering is a Data Mining technique, which has been widely used in many practical applications. From these applications, there are some, like social network analysis, topic detection and tracking, information retrieval, categorization of digital libraries, among others, where objects may belong to more than one cluster; however, most clustering algorithms build disjoint clusters. In this work, we introduce OClustR, a new graph-based clustering algorithm for building overlapping clusters. The proposed algorithm introduces a new graph-covering strategy and a new filtering strategy, which together allow to build overlapping clusterings more accurately than those built by previous algorithms. The experimental evaluation, conducted over several standard collections, showed that our proposed algorithm builds less clusters than those built by the previous related algorithms. Additionally, OClustR builds clusters with overlapping closer to the real overlapping in the collections than the overlapping generated by other clustering algorithms. | |
| dc.format | application/pdf | |
| dc.language | eng | |
| dc.publisher | Elsevier B.V. | |
| dc.relation | citation:Pérez, A., et al., (2013). OClustR: A new graph-based algorithm for overlapping clustering, Neurocomputing Vol. 2013 (121): 234-247 | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | http://creativecommons.org/licenses/by-nc-nd/4.0 | |
| dc.subject | info:eu-repo/classification/Data mining/Data mining | |
| dc.subject | info:eu-repo/classification/Overlapping clustering/Overlapping clustering | |
| dc.subject | info:eu-repo/classification/Graph-based algorithms/Graph-based algorithms | |
| dc.subject | info:eu-repo/classification/cti/1 | |
| dc.subject | info:eu-repo/classification/cti/12 | |
| dc.subject | info:eu-repo/classification/cti/1203 | |
| dc.subject | info:eu-repo/classification/cti/1203 | |
| dc.title | OClustR: A new graph-based algorithm for overlapping clustering | |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:eu-repo/semantics/acceptedVersion | |
| dc.audience | students | |
| dc.audience | teachers | |
| dc.audience | generalPublic | |
