Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
Graph Self-Organizing Maps For Cyclic And Unbounded Graphs, Markus Hagenbuchner, Ah Chung Tsoi, Alessandro Sperduti
Graph Self-Organizing Maps For Cyclic And Unbounded Graphs, Markus Hagenbuchner, Ah Chung Tsoi, Alessandro Sperduti
Ah Chung Tsoi
Self-Organizing Maps capable of processing graph structured information are a relatively new concept. This paper describes a novel concept on the processing of graph structured information using the self organizing map framework which allows the processing of much more general types of graphs, e.g. cyclic graphs, directed graphs. Previous approaches to this problem were limited to the processing of bounded graphs, their computational complexity can grow rapidly with the level of connectivity of the graphs concerned, and are restricted to the processing of positional graphs. The novel concept proposed in this paper, namely, by using the clusters formed in the …
Self Organizing Maps For The Clustering Of Large Sets Of Labeled Graphs, Shujia Zhang, Markus Hagenbuchner, Ah Chung Tsoi, Milly Kc
Self Organizing Maps For The Clustering Of Large Sets Of Labeled Graphs, Shujia Zhang, Markus Hagenbuchner, Ah Chung Tsoi, Milly Kc
Ah Chung Tsoi
Graph Self-Organizing Maps (GraphSOMs) are a new concept in the processing of structured objects using machine learning methods. The GraphSOM is a generalization of the Self-Organizing Maps for Structured Domain (SOM-SD) which had been shown to be a capable unsupervised machine learning method for some types of graphstructured information. An application of the SOM-SD to document mining tasks as part of an international competition: Initiative for the Evaluation of XML Retrieval (INEX), on the clustering of XML formatted documents was conducted, and the method subsequently won the competition in 2005 and 2006 respectively. This paper applies the GraphSOM to theclustering …
A Scalable Lightweight Distributed Crawler For Crawling With Limited Resources, Milly W. Kc, Markus Hagenbuchner, Ah Chung Tsoi
A Scalable Lightweight Distributed Crawler For Crawling With Limited Resources, Milly W. Kc, Markus Hagenbuchner, Ah Chung Tsoi
Ah Chung Tsoi
Web page crawlers are an essential component in a number of Web applications. The sheer size of the Internet can pose problems in the design of Web crawlers. All currently known crawlers implement approximations or have limitations so as to maximize the throughput of the crawl, and hence, maximize the number of pages that can be retrieved within a given time frame. This paper proposes a distributed crawling concept which is designed to avoid approximations, to limit the network overhead, and to run on relatively inexpensive hardware. A set of experiments, and comparisons highlight the effectiveness of the proposed approach.