Self-Organizing Maps
Computing customized page ranks
ACM Transactions on Internet Technology (TOIT)
Efficient Clustering of Structured Documents Using Graph Self-Organizing Maps
Focused Access to XML Documents
Graph self-organizing maps for cyclic and unbounded graphs
Neurocomputing
Computational capabilities of graph neural networks
IEEE Transactions on Neural Networks
A self-organizing map for adaptive processing of structured data
IEEE Transactions on Neural Networks
| Hi-index | 0.00 |
This paper provides an explanation to how a recently developed machine learning approach, namely the Probability Measure Graph Self-Organizing Map (PM-GraphSOM) can be used for the generation of links between referenced or otherwise interlinked documents. This new generation of SOM models are capable of projecting generic graph structured data onto a fixed sized display space. Such a mechanism is normally used for dimension reduction, visualization, or clustering purposes. This paper shows that the PM-GraphSOM training algorithm "inadvertently" encodes relations that exist between the atomic elements in a graph. If the nodes in the graph represent documents, and the links in the graph represent the reference (or hyperlink) structure of the documents, then it is possible to obtain a set of links for a test document whose link structure is unknown. A significant finding of this paper is that the described approach is scalable in that links can be extracted in linear time. It will also be shown that the proposed approach is capable of predicting the pages which would be linked to a new document, and is capable of predicting the links to other documents from a given test document. The approach is applied to web pages from Wikipedia, a relatively large XML text database consisting of many referenced documents.