Comparing the Performances of Neural Network and Rough Set Theory to Reflect the Improvement of Prognostic in Medical Data

In this research, I investigate and compared two of Artificial Intelligence (AI)techniques which are; Neural network and Rough set will be the best technique to be use in analyzing data. Recently, AI is one of the techniques which still in development process that produced few of intelligent systems that helped human to support their daily life such as decision making. In Malaysia, it is newly introduced by a group of researchers from University Science Malaysia. They agreed with others world-wide researchers that AI is very helpful to replaced human intelligence and do many works that can be done by human especially in medical area.In this research, I have chosen three sets of medical data; Wisoncin Prognostic Breast cancer, Parkinson’s diseases and Hepatitis Prognostic. The reason why the medical data is selected for this research because of the popularity among the researchers that done their research in AI by using medical data and the prediction or target attributes is clearly understandable. The results and findings also discussed in this paper. How the experiment has been done; the steps involved also discussed in this paper. I also conclude this paper with conclusion and future work

Rule sets based bilevel decision model

Bilevel decision addresses the problem in which two levels of decision makers, each tries to optimize their individual objectives under constraints, act and react in an uncooperative, sequential manner. Such a bilevel optimization structure appears naturally in many aspects of planning, management and policy making. However, bilevel decision making may involve many uncertain factors in a real world problem. Therefore it is hard to determine the objective functions and constraints of the leader and the follower when build a bilevel decision model. To deal with this issue, this study explores the use of rule sets to format a bilevel decision problem by establishing a rule sets based model. After develop a method to construct a rule sets based bilevel model of a real-world problem, an example to illustrate the construction process is presented. Copyright © 2006, Australian Computer Society, Inc

Rough Set Granularity in Mobile Web Pre-Caching

Mobile Web pre-caching (Web prefetching and caching) is an explication of performance enhancement and storage limitation ofmobile devices

A new solution algorithm for solving rule-sets based bilevel decision problems

Copyright © 2012 John Wiley & Sons, Ltd. Copyright © 2012 John Wiley & Sons, Ltd. Bilevel decision addresses compromises between two interacting decision entities within a given hierarchical complex system under distributed environments. Bilevel programming typically solves bilevel decision problems. However, formulation of objectives and constraints in mathematical functions is required, which are difficult, and sometimes impossible, in real-world situations because of various uncertainties. Our study develops a rule-set based bilevel decision approach, which models a bilevel decision problem by creating, transforming and reducing related rule sets. This study develops a new rule-sets based solution algorithm to obtain an optimal solution from the bilevel decision problem described by rule sets. A case study and a set of experiments illustrate both functions and the effectiveness of the developed algorithm in solving a bilevel decision problem

Facilitating file retrieval on resource limited devices

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.The rapid development of mobile technologies has facilitated users to generate and store files on mobile devices. However, it has become a challenging issue for users to search efficiently and effectively for files of interest in a mobile environment that involves a large number of mobile nodes. In this thesis, file management and retrieval alternatives have been investigated to propose a feasible framework that can be employed on resource-limited devices without altering their operating systems. The file annotation and retrieval framework (FARM) proposed in the thesis automatically annotates the files with their basic file attributes by extracting them from the underlying operating system of the device. The framework is implemented in the JME platform as a case study. This framework provides a variety of features for managing the metadata and file search features on the device itself and on other devices in a networked environment. FARM not only automates the file-search process but also provides accurate results as demonstrated by the experimental analysis. In order to facilitate a file search and take advantage of the Semantic Web Technologies, the SemFARM framework is proposed which utilizes the knowledge of a generic ontology. The generic ontology defines the most common keywords that can be used as the metadata of stored files. This provides semantic-based file search capabilities on low-end devices where the search keywords are enriched with additional knowledge extracted from the defined ontology. The existing frameworks annotate image files only, while SemFARM can be used to annotate all types of files. Semantic heterogeneity is a challenging issue and necessitates extensive research to accomplish the aim of a semantic web. For this reason, significant research efforts have been made in recent years by proposing an enormous number of ontology alignment systems to deal with ontology heterogeneities. In the process of aligning different ontologies, it is essential to encompass their semantic, structural or any system-specific measures in mapping decisions to produce more accurate alignments. The proposed solution, in this thesis, for ontology alignment presents a structural matcher, which computes the similarity between the super-classes, sub-classes and properties of two entities from different ontologies that require aligning. The proposed alignment system (OARS) uses Rough Sets to aggregate the results obtained from various matchers in order to deal with uncertainties during the mapping process of entities. The OARS uses a combinational approach by using a string-based and linguistic-based matcher, in addition to structural-matcher for computing the overall similarity between two entities. The performance of the OARS is evaluated in comparison with existing state of the art alignment systems in terms of precision and recall. The performance tests are performed by using benchmark ontologies and the results show significant improvements, specifically in terms of recall on all groups of test ontologies. There is no such existing framework, which can use alignments for file search on mobile devices. The ontology alignment paradigm is integrated in the SemFARM to further enhance the file search features of the framework as it utilises the knowledge of more than one ontology in order to perform a search query. The experimental evaluations show that it performs better in terms of precision and recall where more than one ontology is available when searching for a required file.Education Commission of Pakistan and the University of Engineering & Technology, Peshawa

Mining fuzzy association rules in large databases with quantitative attributes.

by Kuok, Chan Man.Thesis (M.Phil.)--Chinese University of Hong Kong, 1997.Includes bibliographical references (leaves 74-77).Abstract --- p.iAcknowledgments --- p.iiiChapter 1 --- Introduction --- p.1Chapter 1.1 --- Data Mining --- p.2Chapter 1.2 --- Association Rule Mining --- p.3Chapter 2 --- Background --- p.6Chapter 2.1 --- Framework of Association Rule Mining --- p.6Chapter 2.1.1 --- Large Itemsets --- p.6Chapter 2.1.2 --- Association Rules --- p.8Chapter 2.2 --- Association Rule Algorithms For Binary Attributes --- p.11Chapter 2.2.1 --- AIS --- p.12Chapter 2.2.2 --- SETM --- p.13Chapter 2.2.3 --- "Apriori, AprioriTid and AprioriHybrid" --- p.15Chapter 2.2.4 --- PARTITION --- p.18Chapter 2.3 --- Association Rule Algorithms For Numeric Attributes --- p.20Chapter 2.3.1 --- Quantitative Association Rules --- p.20Chapter 2.3.2 --- Optimized Association Rules --- p.23Chapter 3 --- Problem Definition --- p.25Chapter 3.1 --- Handling Quantitative Attributes --- p.25Chapter 3.1.1 --- Discrete intervals --- p.26Chapter 3.1.2 --- Overlapped intervals --- p.27Chapter 3.1.3 --- Fuzzy sets --- p.28Chapter 3.2 --- Fuzzy association rule --- p.31Chapter 3.3 --- Significance factor --- p.32Chapter 3.4 --- Certainty factor --- p.36Chapter 3.4.1 --- Using significance --- p.37Chapter 3.4.2 --- Using correlation --- p.38Chapter 3.4.3 --- Significance vs. Correlation --- p.42Chapter 4 --- Steps For Mining Fuzzy Association Rules --- p.43Chapter 4.1 --- Candidate itemsets generation --- p.44Chapter 4.1.1 --- Candidate 1-Itemsets --- p.45Chapter 4.1.2 --- Candidate k-Itemsets (k > 1) --- p.47Chapter 4.2 --- Large itemsets generation --- p.48Chapter 4.3 --- Fuzzy association rules generation --- p.49Chapter 5 --- Experimental Results --- p.51Chapter 5.1 --- Experiment One --- p.51Chapter 5.2 --- Experiment Two --- p.53Chapter 5.3 --- Experiment Three --- p.54Chapter 5.4 --- Experiment Four --- p.56Chapter 5.5 --- Experiment Five --- p.58Chapter 5.5.1 --- Number of Itemsets --- p.58Chapter 5.5.2 --- Number of Rules --- p.60Chapter 5.6 --- Experiment Six --- p.61Chapter 5.6.1 --- Varying Significance Threshold --- p.62Chapter 5.6.2 --- Varying Membership Threshold --- p.62Chapter 5.6.3 --- Varying Confidence Threshold --- p.63Chapter 6 --- Discussions --- p.65Chapter 6.1 --- User guidance --- p.65Chapter 6.2 --- Rule understanding --- p.67Chapter 6.3 --- Number of rules --- p.68Chapter 7 --- Conclusions and Future Works --- p.70Bibliography --- p.7

Facilitating file retrieval on resource limited devices

The rapid development of mobile technologies has facilitated users to generate and store files on mobile devices. However, it has become a challenging issue for users to search efficiently and effectively for files of interest in a mobile environment that involves a large number of mobile nodes. In this thesis, file management and retrieval alternatives have been investigated to propose a feasible framework that can be employed on resource-limited devices without altering their operating systems. The file annotation and retrieval framework (FARM) proposed in the thesis automatically annotates the files with their basic file attributes by extracting them from the underlying operating system of the device. The framework is implemented in the JME platform as a case study. This framework provides a variety of features for managing the metadata and file search features on the device itself and on other devices in a networked environment. FARM not only automates the file-search process but also provides accurate results as demonstrated by the experimental analysis. In order to facilitate a file search and take advantage of the Semantic Web Technologies, the SemFARM framework is proposed which utilizes the knowledge of a generic ontology. The generic ontology defines the most common keywords that can be used as the metadata of stored files. This provides semantic-based file search capabilities on low-end devices where the search keywords are enriched with additional knowledge extracted from the defined ontology. The existing frameworks annotate image files only, while SemFARM can be used to annotate all types of files. Semantic heterogeneity is a challenging issue and necessitates extensive research to accomplish the aim of a semantic web. For this reason, significant research efforts have been made in recent years by proposing an enormous number of ontology alignment systems to deal with ontology heterogeneities. In the process of aligning different ontologies, it is essential to encompass their semantic, structural or any system-specific measures in mapping decisions to produce more accurate alignments. The proposed solution, in this thesis, for ontology alignment presents a structural matcher, which computes the similarity between the super-classes, sub-classes and properties of two entities from different ontologies that require aligning. The proposed alignment system (OARS) uses Rough Sets to aggregate the results obtained from various matchers in order to deal with uncertainties during the mapping process of entities. The OARS uses a combinational approach by using a string-based and linguistic-based matcher, in addition to structural-matcher for computing the overall similarity between two entities. The performance of the OARS is evaluated in comparison with existing state of the art alignment systems in terms of precision and recall. The performance tests are performed by using benchmark ontologies and the results show significant improvements, specifically in terms of recall on all groups of test ontologies. There is no such existing framework, which can use alignments for file search on mobile devices. The ontology alignment paradigm is integrated in the SemFARM to further enhance the file search features of the framework as it utilises the knowledge of more than one ontology in order to perform a search query. The experimental evaluations show that it performs better in terms of precision and recall where more than one ontology is available when searching for a required file.EThOS - Electronic Theses Online ServiceEducation Commission of PakistanTechnology, PeshawarGBUnited Kingdo