Abstract
The design of a Knowledge Discovery in Databases (KDD) experiment implies the combined use of several data manipulation tools that are suited for the discovery problem at hand. This implies that users should possess a considerable amount of knowledge and expertise about functionalities and properties of all KDD algorithms implemented in available tools, for choosing the right tools and their proper composition. In order to support users in these demanding activities, we introduce a goal-driven procedure to automatically discover candidate prototype processes by composition of basic algorithms. The core of this procedure is the algorithm matching, which is based on the exploitation of an ontology formalizing the domain of KDD algorithms. The present work focuses on the definition and evaluation of algorithm matching criteria.
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.
References
Diamantini C, Potena D, Storti E (2009) Ontology-driven KDD process composition. In Proceedings of the 8th international symposium on intelligent data analysis, LNCS, 5772, Lyon, France, pp 285–296
Diamantini C, Potena D, Storti E (2009) KDDONTO: an ontology for discovery and composition of kdd algorithms. In: Proceedings of the ECML/PKDD workshop on third generation data mining: towards service-oriented knowledge discovery, Bled, Slovenia, pp 13–24
Winston ME, Chaffin R, Herrmann D (1987) A taxonomy of part-whole relations. Cogn Sci 11(4):417–444
Akkiraju R, Srivastava B, Ivan A, Goodwin R, Syeda-Mahmood T (2006) SEMAPLAN: combining planning with semantic matching to achieve web service composition. In Proceedings of the IEEE international conference on web services, Chicago, IL, USA, pp 37–44
Bianchini D, De Antonellis V, Melchiori M (2008) Flexible semantic-based service matchmaking and discovery. World Wide Web 11(2):227–251
Bernstein A, Provost F, Hill S (2005) Towards intelligent assistance for a data mining process: an ontology based approach for cost-sensitive classification. IEEE Trans Knowl Data Eng 17(4):503–518
Žáková, M, Křemen P, Železný F, Lavrač N (2008) Using ontological reasoning and planning for data mining workflow composition. In Proceedings of the ECML/PKDD workshop on third generation data mining: towards service-oriented knowledge discovery, Antwerp, Belgium, pp 35–41
Arpinar IB, Aleman-Meza B, Zhang R, Maduko A (2004) Ontology-driven Web services composition platform. In Proceedings of IEEE international conference on e-Commerce technology, San Diego, CA, USA, pp 146–152
Fuji K, Suda T (2004) Dynamic service composition using semantic information. In Proceedings of 2nd international conference on service oriented computing, New York, NY, USA, pp 39–48
Lemmens R, Arenas H (2004) Semantic matchmaking in geo service chains: reasoning with a location ontology. In Proceedings of international workshop on database and expert systems applications, Zaragoza, Spain, pp 797–802
Ni Q (2005) Service composition in ontology enabled service oriented architecture for pervasive computing. In Proceedings of workshop on ubiquitous computing and e-Research, Edinburgh, UK
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Diamantini, C., Potena, D., Storti, E. (2010). Automatic Definition of KDD Prototype Processes by Composition. In: D'Atri, A., De Marco, M., Braccini, A., Cabiddu, F. (eds) Management of the Interconnected World. Physica-Verlag HD. https://doi.org/10.1007/978-3-7908-2404-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-7908-2404-9_23
Published:
Publisher Name: Physica-Verlag HD
Print ISBN: 978-3-7908-2403-2
Online ISBN: 978-3-7908-2404-9
eBook Packages: Business and EconomicsBusiness and Management (R0)