Automatic Definition of KDD Prototype Processes by Composition

Claudia Diamantini (), Domenico Potena () and Emanuele Storti ()
Additional contact information
Claudia Diamantini: Università Politecnica delle Marche
Domenico Potena: Università Politecnica delle Marche
Emanuele Storti: Università Politecnica delle Marche

A chapter in Management of the Interconnected World, 2010, pp 193-200 from Springer

Abstract: 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.

Keywords: Service Composition; Process Composition; Approximate Match; Prototype Process; Compound Data (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-7908-2404-9_23

Ordering information: This item can be ordered from
http://www.springer.com/9783790824049

DOI: 10.1007/978-3-7908-2404-9_23

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().