Frans Coenen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Frans Coenen has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Paul Leng
The University of Liverpool
8 shared publications - Graham Goulbourne
The University of Liverpool
2 shared publications - Trevor Bench-Capon
Department of Computer Science, University of Liverpool, Liverpool, UK
2 shared publications B. Beattie
The University of Liverpool
1 shared publicationB. M. Diaz
The University of Liverpool
1 shared publication- Barry Eaglestone
Department of Information Studies, University of Sheffield, United Kingdom
1 shared publication
Latest Publications
- Top Cited Papers
- 20 November 2012
- Published by Maximum Academic Press in The Knowledge Engineering Review
- Vol. 28 (1) , 75-105
A survey of frequent subgraph mining algorithms
Graph mining is an important research area within the domain of data mining. The field of study concentrates on the identification of frequent subgraphs within graph data sets. The research goals are directed at: (i) effective mechanisms for generating candidate subgraphs (without generating duplicates) and (ii) how best to process the generated candidate subgraphs so as to identify the desired frequent subgraphs in a way that is computationally efficient and procedurally effective. This paper presents a survey of current research in the field of frequent subgraph mining and proposes solutions to address the main research issues.
- 20 November 2012
- Published by Maximum Academic Press in The Knowledge Engineering Review
- Vol. 28 (1) , 75-105
Top Cited PapersA survey of frequent subgraph mining algorithms
Graph mining is an important research area within the domain of data mining. The field of study concentrates on the identification of frequent subgraphs within graph data sets. The research goals are directed at: (i) effective mechanisms for generating candidate subgraphs (without generating duplicates) and (ii) how best to process the generated candidate subgraphs so as to identify the desired frequent subgraphs in a way that is computationally efficient and procedurally effective. This paper presents a survey of current research in the field of frequent subgraph mining and proposes solutions to address the main research issues.
- 18 January 2011
- Published by IGI Global Scientific Publishing
A Comparative Study of Associative Classifiers in Mesenchymal Stem Cell Differentiation Analysis
Discovering how Mesenchymal Stem Cells (MSCs) can be differentiated is an important topic in stem cell therapy and tissue engineering. In a general context, such differentiation analysis can be modeled as a classification problem in data mining. Specifically, this is concerned with the single-label multi-class classification task. Previous studies on this topic suggests the Associative Classification (AC) rather than other alternative (Classification) techniques, and presented classification results based on the CMAR (Classification based on Multiple Association Rules) associative classifier. Other AC algorithms include: CBA (Classification Based on Associations), PRM (Predictive Rule Mining), CPAR (Classification based on Predictive Association Rules) and TFPC (Total From Partial Classification). The main aim of this chapter is to compare the performance of different associative classifiers, in terms of classification accuracy, efficiency, number of rules to be generated, quality of such rules, and the maximum number of attributes in rule-antecedents, with respect to MSC differentiation analysis.
- 18 January 2011
- Published by IGI Global Scientific Publishing
A Comparative Study of Associative Classifiers in Mesenchymal Stem Cell Differentiation Analysis
Discovering how Mesenchymal Stem Cells (MSCs) can be differentiated is an important topic in stem cell therapy and tissue engineering. In a general context, such differentiation analysis can be modeled as a classification problem in data mining. Specifically, this is concerned with the single-label multi-class classification task. Previous studies on this topic suggests the Associative Classification (AC) rather than other alternative (Classification) techniques, and presented classification results based on the CMAR (Classification based on Multiple Association Rules) associative classifier. Other AC algorithms include: CBA (Classification Based on Associations), PRM (Predictive Rule Mining), CPAR (Classification based on Predictive Association Rules) and TFPC (Total From Partial Classification). The main aim of this chapter is to compare the performance of different associative classifiers, in terms of classification accuracy, efficiency, number of rules to be generated, quality of such rules, and the maximum number of attributes in rule-antecedents, with respect to MSC differentiation analysis.
- 10 July 2009
- Published by Springer Nature in Artificial Intelligence and Law
- Vol. 17 (3) , 183-215
PADUA: a protocol for argumentation dialogue using association rules
- 10 July 2009
- Published by Springer Nature in Artificial Intelligence and Law
- Vol. 17 (3) , 183-215
PADUA: a protocol for argumentation dialogue using association rules
- 1 January 2009
- Published by Springer Nature
- p. 189-200
The EMADS Extendible Multi-Agent Data Mining Framework
- 1 January 2009
- Published by Springer Nature
- p. 189-200
The EMADS Extendible Multi-Agent Data Mining Framework
- 28 February 2007
- Published by Elsevier in Data & Knowledge Engineering
- Vol. 60 (2) , 345-360
The effect of threshold values on association rule based classification accuracy
- 28 February 2007
- Published by Elsevier in Data & Knowledge Engineering
- Vol. 60 (2) , 345-360
The effect of threshold values on association rule based classification accuracy
- 30 September 2006
- Published by Elsevier in Knowledge-Based Systems
- Vol. 19 (5) , 341-347
The Knowledge Bazaar
- 30 September 2006
- Published by Elsevier in Knowledge-Based Systems
- Vol. 19 (5) , 341-347
The Knowledge Bazaar
- 1 September 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 420-425
Towards an Agent-Based Framework for Online After-Sale Services
The multi-agent paradigm for building intelligent systems has gradually been accepted by researchers and practitioners in the research field of artificial intelligence. There are also attempts of adapting agents and agent-based systems for creating industrial applications and providing e-services. In this paper, we present an attempt to use agents for constructing an online after-sale services system. The system is decomposed into four major cooperative agents, and in which each agent concentrates on particular aspects in the system and expresses intelligence by using various techniques. The proposed agent-based framework for the system is presented at both the micro-level and the macro-level according to the Gala methodology. UML notations are also used to represent some software design models. As the result of this, agents are implemented into a framework for which exploits case-based reasoning (CBR) technique to fulfil real life on-line services' diagnoses and tasks
- 1 September 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 420-425
Towards an Agent-Based Framework for Online After-Sale Services
The multi-agent paradigm for building intelligent systems has gradually been accepted by researchers and practitioners in the research field of artificial intelligence. There are also attempts of adapting agents and agent-based systems for creating industrial applications and providing e-services. In this paper, we present an attempt to use agents for constructing an online after-sale services system. The system is decomposed into four major cooperative agents, and in which each agent concentrates on particular aspects in the system and expresses intelligence by using various techniques. The proposed agent-based framework for the system is presented at both the micro-level and the macro-level according to the Gala methodology. UML notations are also used to represent some software design models. As the result of this, agents are implemented into a framework for which exploits case-based reasoning (CBR) technique to fulfil real life on-line services' diagnoses and tasks
- 24 March 2006
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 10 (3) , 315-331
Tree-based partitioning of date for association rule mining
- 24 March 2006
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 10 (3) , 315-331
Tree-based partitioning of date for association rule mining
- 1 January 2004
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 8 (1) , 25-51
Tree Structures for Mining Association Rules
- 1 January 2004
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 8 (1) , 25-51
Tree Structures for Mining Association Rules
- 1 September 2002
- Published by Elsevier in Knowledge-Based Systems
- Vol. 15 (7) , 391-398
Formalising optimal feature weight setting in case based diagnosis as linear programming problems
- 1 September 2002
- Published by Elsevier in Knowledge-Based Systems
- Vol. 15 (7) , 391-398
Formalising optimal feature weight setting in case based diagnosis as linear programming problems