Enhancing association rules algorithms for mining distributed databases. Integration of fast BitTable and multi-agent association rules mining in distributed medical databases for decision support.
AuthorAbdo, Walid A.A.
SupervisorDahal, Keshav P.
Decision support systems
Intelligent data analysis
Distributed Multi-Agent Association Rules algorithm (DMAAR)
BitTable Multi-Agent Association Rules algorithm (BMAAR)
Pruning Multi-Agent Association Rules algorithm (PMAAR)
Clinical decision making
The University of Bradford theses are licenced under a Creative Commons Licence.
InstitutionUniversity of Bradford
DepartmentDepartment of Computing
MetadataShow full item record
AbstractOver the past few years, mining data located in heterogeneous and geographically distributed sites have been designated as one of the key important issues. Loading distributed data into centralized location for mining interesting rules is not a good approach. This is because it violates common issues such as data privacy and it imposes network overheads. The situation becomes worse when the network has limited bandwidth which is the case in most of the real time systems. This has prompted the need for intelligent data analysis to discover the hidden information in these huge amounts of distributed databases. In this research, we present an incremental approach for building an efficient Multi-Agent based algorithm for mining real world databases in geographically distributed sites. First, we propose the Distributed Multi-Agent Association Rules algorithm (DMAAR) to minimize the all-to-all broadcasting between distributed sites. Analytical calculations show that DMAAR reduces the algorithm complexity and minimizes the message communication cost. The proposed Multi-Agent based algorithm complies with the Foundation for Intelligent Physical Agents (FIPA), which is considered as the global standards in communication between agents, thus, enabling the proposed algorithm agents to cooperate with other standard agents. Second, the BitTable Multi-Agent Association Rules algorithm (BMAAR) is proposed. BMAAR includes an efficient BitTable data structure which helps in compressing the database thus can easily fit into the memory of the local sites. It also includes two BitWise AND/OR operations for quick candidate itemsets generation and support counting. Moreover, the algorithm includes three transaction trimming techniques to reduce the size of the mined data. Third, we propose the Pruning Multi-Agent Association Rules algorithm (PMAAR) which includes three candidate itemsets pruning techniques for reducing the large number of generated candidate itemsets, consequently, reducing the total time for the mining process. The proposed PMAAR algorithm has been compared with existing Association Rules algorithms against different benchmark datasets and has proved to have better performance and execution time. Moreover, PMAAR has been implemented on real world distributed medical databases obtained from more than one hospital in Egypt to discover the hidden Association Rules in patients¿ records to demonstrate the merits and capabilities of the proposed model further. Medical data was anonymously obtained without the patients¿ personal details. The analysis helped to identify the existence or the absence of the disease based on minimum number of effective examinations and tests. Thus, the proposed algorithm can help in providing accurate medical decisions based on cost effective treatments, improving the medical service for the patients, reducing the real time response for the health system and improving the quality of clinical decision making.
Showing items related by title, author, creator and subject.
VM Allocation in Cloud Datacenters Based on the Multi-Agent System. An Investigation into the Design and Response Time Analysis of a Multi-Agent-based Virtual Machine (VM) Allocation/Placement Policy in Cloud DatacentersKouvatsos, Demetres D.; Kiran, Mariam; Al-ou'n, Ashraf M.S. (University of BradfordSchool of Electrical Engineering and Computer Science, Faculty of Engineering and Informatics, 2017)Recent years have witnessed a surge in demand for infrastructure and services to cover high demands on processing big chunks of data and applications resulting in a mega Cloud Datacenter. A datacenter is of high complexity with increasing difficulties to identify, allocate efficiently and fast an appropriate host for the requested virtual machine (VM). Establishing a good awareness of all datacenter’s resources enables the allocation “placement” policies to make the best decision in reducing the time that is needed to allocate and create the VM(s) at the appropriate host(s). However, current algorithms and policies of placement “allocation” do not focus efficiently on awareness of the resources of the datacenter, and moreover, they are based on conventional static techniques. Which are adversely impacting on the allocation progress of the policies. This thesis proposes a new Agent-based allocation/placement policy that employs some of the Multi-Agent system features to get a good awareness of Cloud Datacenter resources and also provide an efficient allocation decision for the requested VMs. Specifically, (a) The Multi-Agent concept is used as a part of the placement policy (b) A Contract Net Protocol is devised to establish good awareness and (c) A verification process is developed to fully dimensional VM specifications during allocation. These new results show a reduction in response time of VM allocation and the usage improvement of occupied resources. The proposed Agent-based policy was implemented using the CloudSim toolkit and consequently was compared, based on a series of typical numerical experiments, with the toolkit’s default policy. The comparative study was carried out in terms of the time duration of VM allocation and other aspects such as the number of available VM types and the amount of occupied resources. Moreover, a two-stage comparative study was introduced through this thesis. Firstly, the proposed policy is compared with four state of the art algorithms, namely the Random algorithm and three one-dimensional Bin-Packing algorithms. Secondly, the three Bin-Packing algorithms were enhanced to have a two-dimensional verification structure and were compared against the proposed new algorithm of the Agent-based policy. Following a rigorous comparative study, it was shown that, through the typical numerical experiments of all stages, the proposed new Agent-based policy had superior performance in terms of the allocation times. Finally, avenues arising from this thesis are included.
Dynamic Scheduling of Steel Casting and Milling using Multi-agentsCowling, Peter I.; Ouelhadj, D.; Petrovic, S. (2009-07-13)This paper presents a case study on the use of multi-agents for integrated dynamic scheduling of steel milling and casting. Steel production is an extremely complex problem requiring the consideration of several different constraints and objectives of a range of processes in a dynamic environment. Most research in steel production scheduling considers static scheduling of processes in isolation. In contrast to earlier approaches, the multi-agent architecture proposed consists of a set of heterogeneous agents which integrate and optimize a range of scheduling objectives related to different processes of steel production, and can adapt to changes in the environment while still achieving overall system goals. Each agent embodies its own scheduling model and realizes its local predictive-reactive schedule taking into account local objectives, real-time information and information received from other agents. Agents cooperate in order to find a globally good schedule, which is able to effectively react to real-time disruptions, and to optimize the original production goals whilst minimising disruption carried by unexpected events occurring in real-time. The inter-agent cooperation is based on the Contract Net Protocol with commitment
TruMet: An approach towards computing trust in multi-agent environment.Bista, Sanat K.; Dahal, Keshav P.; Cowling, Peter I.; Tuladhar, Bishwa R. (2006)The growing popularity of multi-agent based approaches towards the formation and operation of virtual organizations (VO) present over the Internet, offer both opportunities and risks. One of the risks involved in such community is in the identification of trustworthy agent partners for transaction. In this paper we aim to describe our trust model which would contribute in measuring trust in the interacting agents. Named as TruMet, the trust metric model works on the basis of the parameters that we have identified as relevant to the features of the community. The model primarily analyses trust value on the basis of the agent¿s reputation, as provided by the agent itself, and the agent¿s aggregate rating as provided by the witness agents. The final computation of the trust value is given by a weighted average of these two components. While computing the aggregate rating, a weight based method has been adopted to discount the contribution of possibly un-fair ratings by the witness agents.