Abstract
Two typical problems are encountered after obtaining a set of rules from a data mining process: (i) their number can be extremely large and (ii) not all of them are interesting to be considered. Both manual and automatic strategies trying to overcome those problems have to deal with technical issues such as time costs and computational complexity. This work is an attempt to address the quantity and quality issues through using a Neural Network model for predicting the quality of Linked Data rules. Our motivation comes from our previous work, in which we obtained large sets of atomic rules through an inductive logic inspired process traversing Linked Data. Assuming a limited amount of resources, and therefore the impossibility of trying every possible combination to obtain a better rule representing a subset of items, the major issue becomes detecting the combinations that will produce the best rule in the shortest time. Therefore, we propose to use a Neural Network to learn directly from the rules how to recognise a promising aggregation. Our experiments show that including a Neural Network-based prediction model in a rule aggregation process significantly reduces the amount of resources (time and space) required to produce high-quality rules.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Anusha, P., Reddy, G.S.: Interactive Postmining of Association Rules by Validating Ontologies. International Journal of Electronics and Computer Science Engineering (2012)
Baez-Monroy, V., O’Keefe, S.: An Associative Memory for Association Rule Mining. In: International Joint Conference on Neural Networks, IJCNN 2007, pp. 2227–2232. IEEE (2007)
Bizer, C., Heath, T., Berners-Lee, T.: Linked data-the story so far. International Journal on Semantic Web and Information Systems 5(3), 1–22 (2009)
Changchien, S., Lu, T.C.: Mining association rules procedure to support on-line recommendation by customers and products fragmentation. Expert Systems with Applications 20(4), 325–335 (2001)
Chen, Y., Kilgour, D.M., Hipel, K.W.: A decision rule aggregation approach to multiple criteria-multiple participant sorting. Group Decision and Negotiation 21(5), 727–745 (2012)
d’Aquin, M., Jay, N.: Interpreting Data Mining Results with Linked Data for Learning Analytics: Motivation, Case Study and Direction. In: LAK 2013 (2013)
Eom, J.-H.: Neural feature association rule mining for protein interaction prediction. In: Wang, J., Yi, Z., Żurada, J.M., Lu, B.-L., Yin, H. (eds.) ISNN 2006. LNCS, vol. 3973, pp. 690–695. Springer, Heidelberg (2006)
Fayyad, U., Piatetsky-Shapiro, G., Smyth, P.: From data mining to knowledge discovery in databases. AI magazine 17(3), 37 (1996)
Gaber, K., Bahi, M.J., El-Ghazawi, T.: Parallel mining of association rules with a Hopfield type neural network. In: 12th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2000, pp. 90–93. IEEE (2000)
Geng, L., Hamilton, H.J.: Interestingness measures for data mining: A survey. ACM Computing Surveys (CSUR) 38(3), 9 (2006)
Gudys, A., Sikora, M.: An Algorithm for Decision Rules Aggregation. In: KDIR, pp. 216–225 (2010)
Kodratoff, Y., Michalski, R.S., Michalski, R.S., Carbonell, J.G., Mitchell, T.M. (eds.): Machine learning: an artificial intelligence approach. Morgan Kaufmann (1990)
Latkowski, R., Mikołajczyk, M.: Data decomposition and decision rule joining for classification of data with missing values. In: Tsumoto, S., Słowiński, R., Komorowski, J., Grzymała-Busse, J.W. (eds.) RSCTC 2004. LNCS (LNAI), vol. 3066, pp. 254–263. Springer, Heidelberg (2004)
Marinica, C., Guillet, F.: Knowledge-based interactive postmining of association rules using ontologies. IEEE Transactions on Knowledge and Data Engineering 22(6), 784–797 (2010)
Muggleton, S., De Raedt, L.: Inductive logic programming: Theory and methods. The Journal of Logic Programming 19, 629–679 (1994)
Nandhini, M., Janani, M., Sivanandham, S.N.: Association rule mining using swarm intelligence and domain ontology. In: 2012 International Conference on Recent Trends In Information Technology (ICRTIT), pp. 537–541. IEEE (2012)
Narmadha, D., Naveen Sundar, G., Geetha, S.: An Efficient Approach to Prune Mined Association Rules in Large Databases. International Journal of Computer Science Issues (IJCSI) 8(1) (2011)
Paulheim, H.: Exploiting Linked Open Data as Background Knowledge in Data Mining. In: CEUR workshop proceedings DMoLD 2013 collocated with ECMLPKDD 2013, pp. 1–10. RWTH, Aachen (2013)
Pindur, R., Susmaga, R., Stefanowski, J.: Hyperplane aggregation of dominance decision rules. Fundamenta Informaticae 61(2), 117–137 (2004)
Rahman, S.M., Kabir, M.F., Siddiky, F.A.: Rules mining from multi-layered neural networks. International Journal of Computational Systems Engineering 1(1), 13–24 (2012)
Ramesh, C.R., Ramana, K.V.V., Rao, K.R., Sastry, C.V.: Interactive Post Mining Association Rules using Cost Complexity Pruning and Ontologies KDD
Sikora, M.: An algorithm for generalization of decision rules by joining. Foundations on Computating and Decision Science 30(3), 227–239 (2005)
Tiddi, I., d’Aquin, M., Motta, E.: Dedalo: Looking for clusters explanations in a labyrinth of linked data. In: Presutti, V., d’Amato, C., Gandon, F., d’Aquin, M., Staab, S., Tordai, A. (eds.) ESWC 2014. LNCS, vol. 8465, pp. 333–348. Springer, Heidelberg (2014)
Tiddi, I.: Explaining data patterns using background knowledge from Linked Data. In: ISWC 2013 Doctoral Consortium, Sydney, Australia (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Tiddi, I., d’Aquin, M., Motta, E. (2014). Using Neural Networks to Aggregate Linked Data Rules. In: Janowicz, K., Schlobach, S., Lambrix, P., Hyvönen, E. (eds) Knowledge Engineering and Knowledge Management. EKAW 2014. Lecture Notes in Computer Science(), vol 8876. Springer, Cham. https://doi.org/10.1007/978-3-319-13704-9_41
Download citation
DOI: https://doi.org/10.1007/978-3-319-13704-9_41
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13703-2
Online ISBN: 978-3-319-13704-9
eBook Packages: Computer ScienceComputer Science (R0)