Malcolm Crowe
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Malcolm Crowe has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
Colin Fyfe
University of the West of Scotland, School of Computing, High Street, Paisley, Renfrewshire PA1 2BE, United Kingdom
7 shared publications- Fritz Laux
Universität Reutlingen Reutlingen Germany
4 shared publications Jigang Sun
University of the West of Scotland, School of Computing, High Street, Paisley, Renfrewshire PA1 2BE, United Kingdom
3 shared publicationsClark Nicol
Paisley College of Technology
2 shared publications- Colin Fyfe
Applied Computational Intelligence Research Unit, The University of The West of Scotland, UK
2 shared publications Junkang Feng
School of Computing, University of the West of Scotland, Paisley, United Kingdom
2 shared publications
Latest Publications
- Open Access
Implementing the Typed Graph Data Model Using Relational Database Technology
Recent standardization work for database languages has reflected the growing use of typed graph models (TGM) in application development. Such data models are frequently only used early in the design process, and not reflected directly in underlying physical database. In previous work, we have added support to a relational database management system (RDBMS) with role-based structures to ensure that relevant data models are not separately declared in each application but are an important part of the database implementation. In this work, we implement this approach for the TGM: the resulting database implementation is novel in retaining the best features of the graph-based and relational database technologies.
Open AccessImplementing the Typed Graph Data Model Using Relational Database Technology
Recent standardization work for database languages has reflected the growing use of typed graph models (TGM) in application development. Such data models are frequently only used early in the design process, and not reflected directly in underlying physical database. In previous work, we have added support to a relational database management system (RDBMS) with role-based structures to ensure that relevant data models are not separately declared in each application but are an important part of the database implementation. In this work, we implement this approach for the TGM: the resulting database implementation is novel in retaining the best features of the graph-based and relational database technologies.
- Open Access
Database Technology Evolution III: Knowledge Graphs and Linked Data
This paper reviews the changes for database technology represented by the current development of the draft international standard ISO 39075 (Database Languages - GQL), which seeks a unified specification for property graphs and knowledge graphs. This paper examines these current developments as part of our review of the evolution of database technology, and their relation to the longer-term goal of supporting the Semantic Web using relational technology.
Open AccessDatabase Technology Evolution III: Knowledge Graphs and Linked Data
This paper reviews the changes for database technology represented by the current development of the draft international standard ISO 39075 (Database Languages - GQL), which seeks a unified specification for property graphs and knowledge graphs. This paper examines these current developments as part of our review of the evolution of database technology, and their relation to the longer-term goal of supporting the Semantic Web using relational technology.
- Open Access
Graph Data Models and Relational Database Technology
Recent work on database application development platforms has sought to include a declarative formulation of a conceptual data model in the application code, using annotations or attributes. Some recent work has used metadata to include the details of such formulations in the physical database, and this approach brings significant advantages in that the model can be enforced across a range of applications for a single database. In previous work, we have discussed the advantages for enterprise integration of typed graph data models (TGM), which can play a similar role in graphical databases, leveraging the existing support for the unified modelling language UML. Ideally, the integration of systems designed with different models, for example, graphical and relational database, should also be supported. In this work, we implement this approach, using metadata in a relational database management system (DBMS).
Open AccessGraph Data Models and Relational Database Technology
Recent work on database application development platforms has sought to include a declarative formulation of a conceptual data model in the application code, using annotations or attributes. Some recent work has used metadata to include the details of such formulations in the physical database, and this approach brings significant advantages in that the model can be enforced across a range of applications for a single database. In previous work, we have discussed the advantages for enterprise integration of typed graph data models (TGM), which can play a similar role in graphical databases, leveraging the existing support for the unified modelling language UML. Ideally, the integration of systems designed with different models, for example, graphical and relational database, should also be supported. In this work, we implement this approach, using metadata in a relational database management system (DBMS).
- Open Access
Database Technology Evolution
This paper reviews suggestions for changes to database technology coming from the work of many researchers, particularly those working with evolving big data. We discuss new approaches to remote data access and standards that better provide for durability and auditability in settings including business and scientific computing. We propose ways in which the language standards could evolve, with proof-of-concept implementations on Github.
Open AccessDatabase Technology Evolution
This paper reviews suggestions for changes to database technology coming from the work of many researchers, particularly those working with evolving big data. We discuss new approaches to remote data access and standards that better provide for durability and auditability in settings including business and scientific computing. We propose ways in which the language standards could evolve, with proof-of-concept implementations on Github.
- Open Access
- 28 February 2019
- Published by Academy and Industry Research Collaboration Center (AIRCC) in International Journal of Database Management Systems
- Vol. 11 (01) , 37-56
A THEORITICAL EXPLORATION OF DATA MANAGEMENT AND INTEGRATION IN ORGANISATION SECTORS
- 28 February 2019
- Published by Academy and Industry Research Collaboration Center (AIRCC) in International Journal of Database Management Systems
- Vol. 11 (01) , 37-56
Open AccessA THEORITICAL EXPLORATION OF DATA MANAGEMENT AND INTEGRATION IN ORGANISATION SECTORS
- 10 August 2015
- Published by Emerald Publishing in International Journal of Intelligent Computing and Cybernetics
- Vol. 8 (3) , 279-291
A description logic based approach to formalizing the information bearing capability of paths in ER schemata
Purpose: – The purpose of this paper is to show how description logics (DLs) can be applied to formalizing the information bearing capability (IBC) of paths in entity-relationship (ER) schemata. Design/methodology/approach: – The approach follows and extends the idea presented in Xu and Feng (2004), which applies DLs to classifying paths in an ER schema. To verify whether the information content of a data construct (e.g. a path) covers a semantic relation (which formulates a piece of information requirement), the principle of IBC under the source-bearer-receiver framework is presented. It is observed that the IBC principle can be formalized by constructing DL expressions and examining constructors (e.g. quantifiers). Findings: – Description logic can be used as a tool to describe the meanings represented by paths in an ER schema and formalize their IBC. The criteria for identifying data construct distinguishability are also discovered by examining quantifiers in DL expressions of paths of an ER schema. Originality/value: – This paper focuses on classifying paths in data schemas and verifying their formalized IBC by using DLs and the IBC principle. It is a new point of view for evaluation of data representation, which looks at the information borne by data but not data dependencies.
- 10 August 2015
- Published by Emerald Publishing in International Journal of Intelligent Computing and Cybernetics
- Vol. 8 (3) , 279-291
A description logic based approach to formalizing the information bearing capability of paths in ER schemata
Purpose: – The purpose of this paper is to show how description logics (DLs) can be applied to formalizing the information bearing capability (IBC) of paths in entity-relationship (ER) schemata. Design/methodology/approach: – The approach follows and extends the idea presented in Xu and Feng (2004), which applies DLs to classifying paths in an ER schema. To verify whether the information content of a data construct (e.g. a path) covers a semantic relation (which formulates a piece of information requirement), the principle of IBC under the source-bearer-receiver framework is presented. It is observed that the IBC principle can be formalized by constructing DL expressions and examining constructors (e.g. quantifiers). Findings: – Description logic can be used as a tool to describe the meanings represented by paths in an ER schema and formalize their IBC. The criteria for identifying data construct distinguishability are also discovered by examining quantifiers in DL expressions of paths of an ER schema. Originality/value: – This paper focuses on classifying paths in data schemas and verifying their formalized IBC by using DLs and the IBC principle. It is a new point of view for evaluation of data representation, which looks at the information borne by data but not data dependencies.
- 30 October 2014
- Published by Springer Nature
- p. 85-99
Reluctant Reinforcement Learning
- 28 August 2013
- Published by Engineering and Technology Publishing in Journal of Emerging Technologies in Web Intelligence
- Vol. 5 (3)
Priority Recommendation System in an Affiliate Network
Affiliate Networks are the main source of communication between publishers and advertisers where publishers normally subscribe as a service provider and advertisers as an employer. These networks are helping both the publishers and advertisers in terms of providing them with a platform where they can build an automated affiliate connection with each other via these affiliate networks. The problem that is highlighted in this paper is the huge gap that exists between the publisher and advertiser in these affiliate networks and a solution is provided by proposing a priority recommendation system based on K-Means clustering algorithm. Every advertiser desires to have that type of publisher who is already practiced in his category of business or at least has the same skills and talent. This paper presents the concept of a recommendation system based on clustering the real-time data of all the existing transactions of publishers and advertisers of an affiliate network and based on the resulting POST-HOC classified data, a new publisher or advertiser will automatically be classified. Real-time data is provided by Affiliate Future a well-known company among all the affiliate networks. After carefully examining the data the most effective attribute is selected as the base attribute for clustering. The data is encoded into binary numbers for the purpose of clustering. More than one distance approaches are used and the most suitable one is selected for classifying the data.</p
- 28 August 2013
- Published by Engineering and Technology Publishing in Journal of Emerging Technologies in Web Intelligence
- Vol. 5 (3)
Priority Recommendation System in an Affiliate Network
Affiliate Networks are the main source of communication between publishers and advertisers where publishers normally subscribe as a service provider and advertisers as an employer. These networks are helping both the publishers and advertisers in terms of providing them with a platform where they can build an automated affiliate connection with each other via these affiliate networks. The problem that is highlighted in this paper is the huge gap that exists between the publisher and advertiser in these affiliate networks and a solution is provided by proposing a priority recommendation system based on K-Means clustering algorithm. Every advertiser desires to have that type of publisher who is already practiced in his category of business or at least has the same skills and talent. This paper presents the concept of a recommendation system based on clustering the real-time data of all the existing transactions of publishers and advertisers of an affiliate network and based on the resulting POST-HOC classified data, a new publisher or advertiser will automatically be classified. Real-time data is provided by Affiliate Future a well-known company among all the affiliate networks. After carefully examining the data the most effective attribute is selected as the base attribute for clustering. The data is encoded into binary numbers for the purpose of clustering. More than one distance approaches are used and the most suitable one is selected for classifying the data.</p
- 1 February 2013
- Published by Elsevier in Information Sciences
- Vol. 223, 75-101
Incorporating visualisation quality measures to curvilinear component analysis
- 1 February 2013
- Published by Elsevier in Information Sciences
- Vol. 223, 75-101
Incorporating visualisation quality measures to curvilinear component analysis
- 1 September 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Reinforcement Programming for function approximation
Reinforcement learning is one of the major strands of current computational intelligence: it is used to enable an agent to explore an environment in order to ascertain the best actions in that environment. Genetic programming is a method to evolve programs and given the similarity between genetic algorithms and reinforcement learning, it is perhaps surprising that so little attention has been given to using reinforcement learning to identify useful programs. This paper makes a start on this task by investigating using reinforcement learning methods for function approximation.
- 1 September 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Reinforcement Programming for function approximation
Reinforcement learning is one of the major strands of current computational intelligence: it is used to enable an agent to explore an environment in order to ascertain the best actions in that environment. Genetic programming is a method to evolve programs and given the similarity between genetic algorithms and reinforcement learning, it is perhaps surprising that so little attention has been given to using reinforcement learning to identify useful programs. This paper makes a start on this task by investigating using reinforcement learning methods for function approximation.