Affiliation:
1. University of Wollongong, Australia
2. Macau University of Science and Technology, China
Abstract
In recent years there have been some significant research towards the ability of processing related data, particularly the relatedness among atomic elements in a structure with those in another structure. A number of approaches have been developed with various degrees of success. This chapter provides an overview of machine learning approaches for the encoding of related atomic elements in one structure with those in other structures. The chapter briefly reviews a number of unsupervised approaches for such data structures which can be used for solving generic classification, regression, and clustering problems. We will apply this approach to a particularly interesting and challenging problem: The prediction of both the number and their locations of the in-links and out-links of a set of XML documents. In this problem, we are given a set of XML pages, which may represent web pages on the Internet, with in-links and out-links. Based on this training dataset, we wish to predict the number and locations of in-links and out-links of a set of XML documents, which are as yet not linked to other existing XML documents. To the best of our knowledge, this is the only known data driven unsupervised machine learning approach for the prediction of in-links and out-links of XML documents.
Reference30 articles.
1. Learning long-term dependencies with gradient descent is difficult
2. Bianucci, A., Micheli, A., Sperduti, A., & Starita, A. (1998). Quantitative structure-activity relationships of benzodiazepines by recursive cascade correlation. In Proceedings of the 1998 IEEE International Joint Conference on Neural Networks. IEEE World Congress on Computational Intelligence (IJCNN), (p. 117). IEEE Computer Society.
3. String grammars for syntactic pattern recognition;H.Bunke;Syntactic and structural pattern recognition, theory and applications,1990
4. Di Noi, L., Hagenbuchner, M., Scarselli, F., & Tsoi, A. (2010). Web Spam detection by probability mapping graphsoms and graph neural networks. In K. Diamantaras, W. Duch, & L. Iliadis (Eds.), Proceedings of the 20th International Conference on Artificial Neural Networks (ICANN) Lecture Notes in Computer Science: Vol. 6353. (pp. 372-381). Springer.
5. Finding Structure in Time