Centaurs - a Component Based Framework to Mine Large Graphs
| Autor: | Appel, Ana Paula, Hruschka Junior, Estevam Rafael |
|---|---|
| Přispěvatelé: | CNPQ, FAPESP, Capes, CMU |
| Jazyk: | angličtina |
| Rok vydání: | 2011 |
| Předmět: | |
| Zdroj: | Journal of Information and Data Management; Vol 2 No 1 (2011): Journal of Information and Data Management; 19 Journal of Information and Data Management; v. 2 n. 1 (2011): Journal of Information and Data Management; 19 Journal of Information and Data Management; v. 2, n. 1 (2011): Journal of Information and Data Management; 19 |
| ISSN: | 2178-7107 |
| Popis: | The increase of the amount of data represented as a graph, likecomplex networks, motivated the creation of a new research area called graph mining. This work proposes a new framework based on components, called Centaurs, to mine data represented as a graph. The main idea of Centaurs is to couple community detection and link prediction algorithms to mine missing edges that were missed during the graph building process.Graph preprocessing and storage algorithms are also explored in this proposal, given that large graphs cannot always be storage in main memory only.The main Centaurs's case study is the Read the Web project that aims to build a graph to represent knowledge extract from the Web based on a never ending learning algorithm. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|