Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Bioinformatics (2)
- Computational Intelligence (2)
- Data Mining (2)
- Granular Computing (2)
- SVM (Support Vector Machine) (1)
-
- Ant Colony Algorithms (1)
- Bagging (1)
- Benes Network (1)
- Binary Classification (1)
- Boosting (1)
- CAD tools (1)
- Connected Dominating Set (1)
- DNA microarray (1)
- Data classification (1)
- Data partition (1)
- Data preparation (1)
- Decision Support System (1)
- Design (1)
- Dynamic terrain (1)
- Fuzzy Association Rule Mining (1)
- Fuzzy logic (1)
- Fuzzy sets (1)
- Genetic Algorithms (1)
- Genotype (1)
- Granular Support Vector Machines (1)
- Granular computing (1)
- Haplotype (1)
- Interval neutrosophic logic (1)
- Interval neutrosophic sets (1)
- K-means clustering algorithm (1)
Articles 1 - 10 of 10
Full-Text Articles in Entire DC Network
Fuzzy-Granular Based Data Mining For Effective Decision Support In Biomedical Applications, Yuanchen He
Fuzzy-Granular Based Data Mining For Effective Decision Support In Biomedical Applications, Yuanchen He
Computer Science Dissertations
Due to complexity of biomedical problems, adaptive and intelligent knowledge discovery and data mining systems are highly needed to help humans to understand the inherent mechanism of diseases. For biomedical classification problems, typically it is impossible to build a perfect classifier with 100% prediction accuracy. Hence a more realistic target is to build an effective Decision Support System (DSS). In this dissertation, a novel adaptive Fuzzy Association Rules (FARs) mining algorithm, named FARM-DS, is proposed to build such a DSS for binary classification problems in the biomedical domain. Empirical studies show that FARM-DS is competitive to state-of-the-art classifiers in terms …
A Framework For Dynamic Terrain With Application In Off-Road Ground Vehicle Simulations, Anthony Scott Aquilio
A Framework For Dynamic Terrain With Application In Off-Road Ground Vehicle Simulations, Anthony Scott Aquilio
Computer Science Dissertations
The dissertation develops a framework for the visualization of dynamic terrains for use in interactive real-time 3D systems. Terrain visualization techniques may be classified as either static or dynamic. Static terrain solutions simulate rigid surface types exclusively; whereas dynamic solutions can also represent non-rigid surfaces. Systems that employ a static terrain approach lack realism due to their rigid nature. Disregarding the accurate representation of terrain surface interaction is rationalized because of the inherent difficulties associated with providing runtime dynamism. Nonetheless, dynamic terrain systems are a more correct solution because they allow the terrain database to be modified at run-time for …
Cad Tools For Dna Micro-Array Design, Manufacture And Application, Nisar Hundewale
Cad Tools For Dna Micro-Array Design, Manufacture And Application, Nisar Hundewale
Computer Science Dissertations
Motivation: As the human genome project progresses and some microbial and eukaryotic genomes are recognized, numerous biotechnological processes have attracted increasing number of biologists, bioengineers and computer scientists recently. Biotechnological processes profoundly involve production and analysis of highthroughput experimental data. Numerous sequence libraries of DNA and protein structures of a large number of micro-organisms and a variety of other databases related to biology and chemistry are available. For example, microarray technology, a novel biotechnology, promises to monitor the whole genome at once, so that researchers can study the whole genome on the global level and have a better picture of …
Algorithms For Computational Genetics Epidemiology, Jingwu He
Algorithms For Computational Genetics Epidemiology, Jingwu He
Computer Science Dissertations
The most intriguing problems in genetics epidemiology are to predict genetic disease susceptibility and to associate single nucleotide polymorphisms (SNPs) with diseases. In such these studies, it is necessary to resolve the ambiguities in genetic data. The primary obstacle for ambiguity resolution is that the physical methods for separating two haplotypes from an individual genotype (phasing) are too expensive. Although computational haplotype inference is a well-explored problem, high error rates continue to deteriorate association accuracy. Secondly, it is essential to use a small subset of informative SNPs (tag SNPs) accurately representing the rest of the SNPs (tagging). Tagging can achieve …
Svm-Based Negative Data Mining To Binary Classification, Fuhua Jiang
Svm-Based Negative Data Mining To Binary Classification, Fuhua Jiang
Computer Science Dissertations
The properties of training data set such as size, distribution and the number of attributes significantly contribute to the generalization error of a learning machine. A not well-distributed data set is prone to lead to a partial overfitting model. Two approaches proposed in this dissertation for the binary classification enhance useful data information by mining negative data. First, an error driven compensating hypothesis approach is based on Support Vector Machines (SVMs) with (1+k)-iteration learning, where the base learning hypothesis is iteratively compensated k times. This approach produces a new hypothesis on the new data set in which each label is …
Clustering System And Clustering Support Vector Machine For Local Protein Structure Prediction, Wei Zhong
Clustering System And Clustering Support Vector Machine For Local Protein Structure Prediction, Wei Zhong
Computer Science Dissertations
Protein tertiary structure plays a very important role in determining its possible functional sites and chemical interactions with other related proteins. Experimental methods to determine protein structure are time consuming and expensive. As a result, the gap between protein sequence and its structure has widened substantially due to the high throughput sequencing techniques. Problems of experimental methods motivate us to develop the computational algorithms for protein structure prediction. In this work, the clustering system is used to predict local protein structure. At first, recurring sequence clusters are explored with an improved K-means clustering algorithm. Carefully constructed sequence clusters are used …
Granular Support Vector Machines Based On Granular Computing, Soft Computing And Statistical Learning, Yuchun Tang
Granular Support Vector Machines Based On Granular Computing, Soft Computing And Statistical Learning, Yuchun Tang
Computer Science Dissertations
With emergence of biomedical informatics, Web intelligence, and E-business, new challenges are coming for knowledge discovery and data mining modeling problems. In this dissertation work, a framework named Granular Support Vector Machines (GSVM) is proposed to systematically and formally combine statistical learning theory, granular computing theory and soft computing theory to address challenging predictive data modeling problems effectively and/or efficiently, with specific focus on binary classification problems. In general, GSVM works in 3 steps. Step 1 is granulation to build a sequence of information granules from the original dataset or from the original feature space. Step 2 is modeling Support …
Topology Control, Routing Protocols And Performance Evaluation For Mobile Wireless Ad Hoc Networks, Hui Liu
Topology Control, Routing Protocols And Performance Evaluation For Mobile Wireless Ad Hoc Networks, Hui Liu
Computer Science Dissertations
A mobile ad-hoc network (MANET) is a collection of wireless mobile nodes forming a temporary network without the support of any established infrastructure or centralized administration. There are many potential applications based the techniques of MANETs, such as disaster rescue, personal area networking, wireless conference, military applications, etc. MANETs face a number of challenges for designing a scalable routing protocol due to their natural characteristics. Guaranteeing delivery and the capability to handle dynamic connectivity are the most important issues for routing protocols in MANETs. In this dissertation, we will propose four algorithms that address different aspects of routing problems in …
Interval Neutrosophic Sets And Logic: Theory And Applications In Computing, Haibin Wang
Interval Neutrosophic Sets And Logic: Theory And Applications In Computing, Haibin Wang
Computer Science Dissertations
A neutrosophic set is a part of neutrosophy that studies the origin, nature, and scope of neutralities, as well as their interactions with different ideational spectra. The neutrosophic set is a powerful general formal framework that has been recently proposed. However, the neutrosophic set needs to be specified from a technical point of view. Here, we define the set-theoretic operators on an instance of a neutrosophic set, and call it an Interval Neutrosophic Set (INS). We prove various properties of INS, which are connected to operations and relations over INS. We also introduce a new logic system based on interval …
Upper Bound Analysis And Routing In Optical Benes Networks, Jiling Zhong
Upper Bound Analysis And Routing In Optical Benes Networks, Jiling Zhong
Computer Science Dissertations
Multistage Interconnection Networks (MIN) are popular in switching and communication applications. It has been used in telecommunication and parallel computing systems for many years. The new challenge facing optical MIN is crosstalk, which is caused by coupling two signals within a switching element. Crosstalk is not too big an issue in the Electrical Domain, but due to the stringent Bit Error Rate (BER) constraint, it is a big major concern in the Optical Domain. In this research dissertation, we will study the blocking probability in the optical network and we will study the deterministic conditions for strictly non-blocking Vertical Stacked …