Learning the naive bayes classifier with optimization models
- Authors: Taheri, Sona , Mammadov, Musa
- Date: 2013
- Type: Text , Journal article
- Relation: International Journal of Applied Mathematics and Computer Science Vol. 23, no. 4 (2013), p. 787-795
- Full Text:
- Reviewed:
- Description: Naive Bayes is among the simplest probabilistic classifiers. It often performs surprisingly well in many real world applications, despite the strong assumption that all features are conditionally independent given the class. In the learning process of this classifier with the known structure, class probabilities and conditional probabilities are calculated using training data, and then values of these probabilities are used to classify new observations. In this paper, we introduce three novel optimization models for the naive Bayes classifier where both class probabilities and conditional probabilities are considered as variables. The values of these variables are found by solving the corresponding optimization problems. Numerical experiments are conducted on several real world binary classification data sets, where continuous features are discretized by applying three different methods. The performances of these models are compared with the naive Bayes classifier, tree augmented naive Bayes, the SVM, C4.5 and the nearest neighbor classifier. The obtained results demonstrate that the proposed models can significantly improve the performance of the naive Bayes classifier, yet at the same time maintain its simple structure.
Min-max optimal control of linear systems with uncertainty and terminal state constraints
- Authors: Wu, Changzhi , Lay Teo, Kok , Wu, Soonyi
- Date: 2013
- Type: Text , Journal article
- Relation: Automatica Vol. 49, no. 6 (2013), p. 1809-1815
- Full Text: false
- Reviewed:
- Description: In this paper, a class of min-max optimal control problems with continuous dynamical systems and quadratic terminal constraints is studied. The main contribution is that the original terminal state constraint in which the disturbance is involved is transformed into an equivalent linear matrix inequality without disturbance under certain conditions. Then, the original min-max optimal control problem is solved via solving a sequence of semi-definite programming problems. An example is presented to illustrate the proposed method. © 2013 Elsevier Ltd. All rights reserved.
- Description: 2003011022
Modeling of secured cloud network: - The case of an educational institute
- Authors: Bevinakoppa, Savitri , Sharma, Geetu , Venkatraman, Sitalakshmi
- Date: 2013
- Type: Text , Conference paper
- Relation: Recent researches in Infromation Science & Applications p. 150-155
- Full Text: false
- Reviewed:
Predicting cardiac autonomic neuropathy category for diabetic data with missing values
- Authors: Abawajy, Jemal , Kelarev, Andrei , Chowdhury, Morshed , Stranieri, Andrew , Jelinek, Herbert
- Date: 2013
- Type: Text , Journal article
- Relation: Computers in Biology and Medicine Vol. 43, no. 10 (2013), p. 1328-1333
- Full Text:
- Reviewed:
- Description: Cardiovascular autonomic neuropathy (CAN) is a serious and well known complication of diabetes. Previous articles circumvented the problem of missing values in CAN data by deleting all records and fields with missing values and applying classifiers trained on different sets of features that were complete. Most of them also added alternative features to compensate for the deleted ones. Here we introduce and investigate a new method for classifying CAN data with missing values. In contrast to all previous papers, our new method does not delete attributes with missing values, does not use classifiers, and does not add features. Instead it is based on regression and meta-regression combined with the Ewing formula for identifying the classes of CAN. This is the first article using the Ewing formula and regression to classify CAN. We carried out extensive experiments to determine the best combination of regression and meta-regression techniques for classifying CAN data with missing values. The best outcomes have been obtained by the additive regression meta-learner based on M5Rules and combined with the Ewing formula. It has achieved the best accuracy of 99.78% for two classes of CAN, and 98.98% for three classes of CAN. These outcomes are substantially better than previous results obtained in the literature by deleting all missing attributes and applying traditional classifiers to different sets of features without regression. Another advantage of our method is that it does not require practitioners to perform more tests collecting additional alternative features. © 2013 Elsevier Ltd.
- Description: C1
A hybrid of multiobjective evolutionary algorithm and HMM-Fuzzy model for time series prediction
- Authors: Hassan, Md Rafiul , Nath, Gupta , Kirley, Michael , Kamruzzaman, Joarder
- Date: 2012
- Type: Text , Journal article
- Relation: Neurocomputing Vol. 81, no. April (2012), p. 1-11
- Full Text: false
- Reviewed:
- Description: In this paper, we introduce a new hybrid of Hidden Markov Model (HMM), Fuzzy Logic and multiobjective Evolutionary Algorithm (EA) for building a fuzzy model to predict non-linear time series data. In this hybrid approach, the HMM's log-likelihood score for each data pattern is used to rank the data and fuzzy rules are generated using the ranked data. We use multiobjective EA to find a range of trade-off solutions between the number of fuzzy rules and the prediction accuracy. The model is tested on a number of benchmark and more recent financial time series data. The experimental results clearly demonstrate that our model is able to generate a reduced number of fuzzy rules with similar (and in some cases better) performance compared with typical data driven fuzzy models reported in the literature.
Calibration of an articulated CMM using stochastic approximations
- Authors: Sultan, Ibrahim , Puthiyaveettil, Prajeesh
- Date: 2012
- Type: Text , Journal article
- Relation: International Journal of Advanced Manufacturing Technology Vol. 63, no. 1-4 (2012), p. 201-207
- Full Text:
- Reviewed:
- Description: A coordinate measuring machine (CMM) is meant to digitise the spatial locations of points and feed the resulting measurements to a CAD system for storing and processing. For reliable utilisation of a CMM, a calibration procedure is often undertaken to eliminate the inaccuracies which result from manufacturing, assembly and installation errors. In this paper, an Immersion digitizer coordinate measuring machine has been calibrated using an accurately manufactured master cuboid fixture. This CMM has been designed as an articulated manipulator to enhance its dexterity and versatility. As such, the calibration problem is tackled with the aid of a kinematic model similar to those employed for the analysis of serial robots. In addition, a stochastic-based optimisation technique is used to identify the parameters of the kinematic model in order for the accurate performance to be achieved. The experimental results demonstrate the effectiveness of this method, whereby the measuring accuracy has been improved considerably. © 2012 Springer-Verlag London Limited.
- Description: 2003010394
Gene regulatory network modeling via global optimization of high-order dynamic Bayesian network
- Authors: Nguyen, Vinh , Chetty, Madhu , Coppel, Ross , Wangikar, Pramod
- Date: 2012
- Type: Text , Journal article
- Relation: BMC Bioinformatics Vol. 13, no. 131 (2012), p. 1-16
- Full Text:
- Reviewed:
- Description: Abstract Background Dynamic Bayesian network (DBN) is among the mainstream approaches for modeling various biological networks, including the gene regulatory network (GRN). Most current methods for learning DBN employ either local search such as hill-climbing, or a meta stochastic global optimization framework such as genetic algorithm or simulated annealing, which are only able to locate sub-optimal solutions. Further, current DBN applications have essentially been limited to small sized networks. Results To overcome the above difficulties, we introduce here a deterministic global optimization based DBN approach for reverse engineering genetic networks from time course gene expression data. For such DBN models that consist only of inter time slice arcs, we show that there exists a polynomial time algorithm for learning the globally optimal network structure. The proposed approach, named GlobalMIT+, employs the recently proposed information theoretic scoring metric named mutual information test (MIT). GlobalMIT+ is able to learn high-order time delayed genetic interactions, which are common to most biological systems. Evaluation of the approach using both synthetic and real data sets, including a 733 cyanobacterial gene expression data set, shows significantly improved performance over other techniques. Conclusions Our studies demonstrate that deterministic global optimization approaches can infer large scale genetic networks.
K-complex detection using a hybrid-synergic machine learning method
- Authors: Vu, Huy Quan , Li, Gang , Sukhorukova, Nadezda , Beliakov, Gleb , Liu, Shaowu , Philippe, Carole , Amiel, Hélène , Ugon, Adrien
- Date: 2012
- Type: Text , Journal article
- Relation: IEEE Transactions on Systems, Man and Cybernetics Part C : Applications and Reviews Vol. 42, no. 6 (2012), p. 1478-1490
- Full Text: false
- Reviewed:
- Description: Sleep stage identification is the first step in modern sleep disorder diagnostics process. K-complex is an indicator for the sleep stage 2. However, due to the ambiguity of the translation of the medical standards into a computer-based procedure, reliability of automated K-complex detection from the EEG wave is still far from expectation. More specifically, there are some significant barriers to the research of automatic K-complex detection. First, there is no adequate description of K-complex that makes it difficult to develop automatic detection algorithm. Second, human experts only provided the label for whether a whole EEG segment contains K-complex or not, rather than individual labels for each subsegment. These barriers render most pattern recognition algorithms inapplicable in detecting K-complex. In this paper, we attempt to address these two challenges, by designing a new feature extraction method that can transform visual features of the EEG wave with any length into mathematical representation and proposing a hybrid-synergic machine learning method to build a K-complex classifier. The tenfold cross-validation results indicate that both the accuracy and the precision of this proposed model are at least as good as a human expert in K-complex detection. © 1998-2012 IEEE.
- Description: 2003010569
Novel weighting in single hidden layer feedforward neural networks for data classification
- Authors: Seifollahi, Sattar , Yearwood, John , Ofoghi, Bahadorreza
- Date: 2012
- Type: Text , Journal article
- Relation: Computers and Mathematics with Applications Vol. 64, no. 2 (2012), p. 128-136
- Full Text: false
- Reviewed:
- Description: We propose a binary classifier based on the single hidden layer feedforward neural network (SLFN) using radial basis functions (RBFs) and sigmoid functions in the hidden layer. We use a modified attribute-class correlation measure to determine the weights of attributes in the networks. Moreover, we propose new weights called as influence weights to utilize in the weights connecting the input layer and the hidden layer nodes (hidden weights) of the network with sigmoid hidden nodes. These weights are calculated as the sum of conditional probabilities of attribute values given class labels. Our learning procedure of the networks is based on the extreme learning machines; in which the parameters of the hidden nodes are first calculated and then the weights connecting the hidden nodes and output nodes (output weights) are found. The results of the networks with the proposed weights on some benchmark data sets show improvements over those of the conventional networks. © 2012 Elsevier Ltd. All rights reserved.
Redesigning the assessment of an entrepreneurship course in an information technology degree program : Embedding assessment for learning practices
- Authors: Pardede, Eric , Lyons, Judith
- Date: 2012
- Type: Text , Journal article
- Relation: IEEE Transactions on Education Vol. 55, no. 4 (2012), p. 566 - 572
- Full Text: false
- Reviewed:
- Description: Entrepreneurship is a novel course in the curriculum for students in the Information Technology (IT) degree program at La Trobe University, Bundoora, Australia. In comparison to other IT-related courses, the Entrepreneurship course seeks to develop business management knowledge and skills; its learning design is thus different to that of other courses in the IT program. The concept of constructive alignment for curriculum renewal suggests that there are several components of good course design. In this paper, we use the principles of constructive alignment to analyze and redesign several components of the Entrepreneurship course. The focus is on reviewing and aligning the assessment tasks to ensure an effective evaluation and the achievement of student learning outcomes. Since assessment drives student learning, we describe the innovative assessment tasks that were implemented to enhance student learning, provide the rationale for the design of these tasks as supported by the current literature, and reflect on possible future improvements. The course redesign process and the constructive alignment and innovative assessment can be applied to other courses in the field, and more broadly to curriculum, teaching, and learning in higher education.
Redesigning the assessment of an entrepreneurship course in an information technology degree program : Embedding assessment for learning practices
- Authors: Pardede, Eric , Lyons, Judith
- Date: 2012
- Type: Text , Journal article
- Relation: IEEE Transactions on Education Vol. 55, no. 4 (2012), p. 566 - 572
- Full Text: false
- Reviewed:
- Description: Entrepreneurship is a novel course in the curriculum for students in the Information Technology (IT) degree program at La Trobe University, Bundoora, Australia. In comparison to other IT-related courses, the Entrepreneurship course seeks to develop business management knowledge and skills; its learning design is thus different to that of other courses in the IT program. The concept of constructive alignment for curriculum renewal suggests that there are several components of good course design. In this paper, we use the principles of constructive alignment to analyze and redesign several components of the Entrepreneurship course. The focus is on reviewing and aligning the assessment tasks to ensure an effective evaluation and the achievement of student learning outcomes. Since assessment drives student learning, we describe the innovative assessment tasks that were implemented to enhance student learning, provide the rationale for the design of these tasks as supported by the current literature, and reflect on possible future improvements. The course redesign process and the constructive alignment and innovative assessment can be applied to other courses in the field, and more broadly to curriculum, teaching, and learning in higher education.
Sliding-window designs for vertex-based shape coding
- Authors: Sohel, Ferdous , Karmakar, Gour , Dooley, Laurence , Bennamoun, M.
- Date: 2012
- Type: Text , Journal article
- Relation: IEEE Transactions on Multimedia Vol. 14, no. 3 (June 2012), p. 683-692
- Full Text: false
- Reviewed:
- Description: Traditionally the sliding window (SW) has been employed in vertex-based operational rate distortion (ORD) optimal shape coding algorithms to ensure consistent distortion (quality) measurement and improve computational efficiency. It also regulates the memory requirements for an encoder design enabling regular, symmetrical hardware implementations. This paper presents a series of new enhancements to existing techniques for determining the best SW-length within a rate-distortion (RD) framework, and analyses the nexus between SW-length and storage for ORD hardware realizations. In addition, it presents an efficient bit-allocation strategy for managing multiple shapes together with a generalized adaptive SW scheme which integrates localized curvature information (cornerity) on contour points with a bi-directional spatial distance, to afford a superior and more pragmatic SW design compared with existing adaptive SW solutions which are based on only cornerity values. Experimental results consistently corroborate the effectiveness of these new strategies.
A Markov-blanket-based model for gene regulatory network inference
- Authors: Ram, Ramesh , Chetty, Madhu
- Date: 2011
- Type: Text , Journal article
- Relation: Transactions on Computational Biology and Bioinformatics Vol. 8, no. 2 (2011), p.
- Full Text: false
- Reviewed:
- Description: An efficient two-step Markov blanket method for modeling and inferring complex regulatory networks from large-scale microarray data sets is presented. The inferred gene regulatory network (GRN) is based on the time series gene expression data capturing the underlying gene interactions. For constructing a highly accurate GRN, the proposed method performs: 1) discovery of a gene's Markov Blanket (MB), 2) formulation of a flexible measure to determine the network's quality, 3) efficient searching with the aid of a guided genetic algorithm, and 4) pruning to obtain a minimal set of correct interactions. Investigations are carried out using both synthetic as well as yeast cell cycle gene expression data sets. The realistic synthetic data sets validate the robustness of the method by varying topology, sample size, time delay, noise, vertex in-degree, and the presence of hidden nodes. It is shown that the proposed approach has excellent inferential capabilities and high accuracy even in the presence of noise. The gene network inferred from yeast cell cycle data is investigated for its biological relevance using well-known interactions, sequence analysis, motif patterns, and GO data. Further, novel interactions are predicted for the unknown genes of the network and their influence on other genes is also discussed.
A survey of audio-based music classification and annotation
- Authors: Fu, Zhouyu , Lu, Guojun , Ting, Kaiming , Zhang, Dengsheng
- Date: 2011
- Type: Text , Journal article
- Relation: IEEE Transactions on Multimedia Vol. 13, no. 2 (2011), p. 303-319
- Full Text: false
- Reviewed:
- Description: Music information retrieval (MIR) is an emerging research area that receives growing attention from both the research community and music industry. It addresses the problem of querying and retrieving certain types of music from large music data set. Classification is a fundamental problem in MIR. Many tasks in MIR can be naturally cast in a classification setting, such as genre classification, mood classification, artist recognition, instrument recognition, etc. Music annotation, a new research area in MIR that has attracted much attention in recent years, is also a classification problem in the general sense. Due to the importance of music classification in MIR research, rapid development of new methods, and lack of review papers on recent progress of the field, we provide a comprehensive review on audio-based classification in this paper and systematically summarize the state-of-the-art techniques for music classification. Specifically, we have stressed the difference in the features and the types of classifiers used for different classification tasks. This survey emphasizes on recent development of the techniques and discusses several open issues for future research.
Anxiety online-A virtual clinic: Preliminary outcomes following completion of five fully automated treatment programs for anxiety disorders and symptoms
- Authors: Klein, Britt , Meyer, Denny , Austin, David , Kyrios, Michael
- Date: 2011
- Type: Text , Journal article
- Relation: Journal of Medical Internet Research Vol. 13, no. 4 (2011), p.
- Full Text:
- Reviewed:
- Description: Background: The development of e-mental health interventions to treat or prevent mental illness and to enhance wellbeing has risen rapidly over the past decade. This development assists the public in sidestepping some of the obstacles that are often encountered when trying to access traditional face-to-face mental health care services. Objective: The objective of our study was to investigate the posttreatment effectiveness of five fully automated self-help cognitive behavior e-therapy programs for generalized anxiety disorder (GAD), panic disorder with or without agoraphobia (PD/A), obsessive-compulsive disorder (OCD), posttraumatic stress disorder (PTSD), and social anxiety disorder (SAD) offered to the international public via Anxiety Online, an open-access full-service virtual psychology clinic for anxiety disorders. Methods: We used a naturalistic participant choice, quasi-experimental design to evaluate each of the five Anxiety Online fully automated self-help e-therapy programs. Participants were required to have at least subclinical levels of one of the anxiety disorders to be offered the associated disorder-specific fully automated self-help e-therapy program. These programs are offered free of charge via Anxiety Online. Results: A total of 225 people self-selected one of the five e-therapy programs (GAD, n = 88; SAD, n = 50; PD/A, n = 40; PTSD, n = 30; OCD, n = 17) and completed their 12-week posttreatment assessment. Significant improvements were found on 21/25 measures across the five fully automated self-help programs. At postassessment we observed significant reductions on all five anxiety disorder clinical disorder severity ratings (Cohen d range 0.72-1.22), increased confidence in managing one's own mental health care (Cohen d range 0.70-1.17), and decreases in the total number of clinical diagnoses (except for the PD/A program, where a positive trend was found) (Cohen d range 0.45-1.08). In addition, we found significant improvements in quality of life for the GAD, OCD, PTSD, and SAD e-therapy programs (Cohen d range 0.11-0.96) and significant reductions relating to general psychological distress levels for the GAD, PD/A, and PTSD e-therapy programs (Cohen d range 0.23-1.16). Overall, treatment satisfaction was good across all five e-therapy programs, and posttreatment assessment completers reported using their e-therapy program an average of 395.60 (SD 272.2) minutes over the 12-week treatment period. Conclusions: Overall, all five fully automated self-help e-therapy programs appear to be delivering promising high-quality outcomes; however, the results require replication. © Britt Klein, Denny Meyer, David William Austin, Michael Kyrios.
Geometric distortion measurement for shape coding: a contemporary review
- Authors: Sohel, Ferdous , Karmakar, Gour , Dooley, Laurence , Bennamoun, M.
- Date: 2011
- Type: Text , Journal article
- Relation: ACM Computing Surveys Vol. 43, no. 4 (2011), p. 1-22
- Full Text: false
- Reviewed:
- Description: Geometric distortion measurement and the associated metrics involved are integral to the Rate Distortion (RD) shape coding framework, with importantly the efficacy of the metrics being strongly influenced by the underlying measurement strategy. This has been the catalyst for many different techniques with this article presenting a comprehensive review of geometric distortion measurement, the diverse metrics applied, and their impact on shape coding. The respective performance of these measuring strategies is analyzed from both a RD and complexity perspective, with a recent distortion measurement technique based on arc-length-parameterization being comparatively evaluated. Some contemporary research challenges are also investigated, including schemes to effectively quantify shape deformation.
GlobalMIT: learning globally optimal dynamic Bayesian network with the mutual information test criterion
- Authors: Nguyen, Vinh , Chetty, Madhu , Coppel, Ross , Wangikar, Pramod
- Date: 2011
- Type: Text , Journal article
- Relation: Bioinformatics Vol. 27, no. 19 (2011), p.2765-2766
- Full Text: false
- Reviewed:
New algorithms for navigating a gantry tractor comprising a 'chorus line' of synchronized modules
- Authors: Percy, Andrew , Spark, Ian , Ibrahim, Yousef
- Date: 2011
- Type: Text , Journal article
- Relation: IEEE Transactions on Industrial Electronics Vol. 58, no. 2 (2011), p. 398-402
- Full Text: false
- Reviewed:
- Description: This paper presents two new algorithms for real-time calculation of the wheel angles and speeds of gantry tractor modules. In transport mode, the gantry tractor is, in a sense, a snakelike robot with passive joints and active wheels, with each module having autonomous four-wheel drive and four-wheel steering. The algorithms determine the wheel angles and speeds of each module with the prescription that the four wheels will have the same center of curvature, wheel speeds provide cooperative redundancy, and all hitching points follow the same path, thereby eliminating scuffing and minimizing off-tracking. Details of the analytical algorithm for a predetermined path were presented at the 2009 IEEE International Conference on Industrial Technology, together with a simulation for a single module. In this paper, we also present the results of a newly developed numerical algorithm which enables the gantry tractor to be steered online by an operator. We also show, by simulation, that this new numerical algorithm gives a good approximation to analytical solutions. The numerical algorithm is then used to calculate wheel angles and speeds for a three-module tractor with the results depicted graphically as functions of time.
Simplifying and improving ant-based clustering
- Authors: Tan, Swee , Ting, Kaiming , Teng, Shyh
- Date: 2011
- Type: Text , Conference paper
- Relation: 11th International Conference on Computational Science, ICCS 2011; Singapore, Singapore; 1st-3rd June 2011, published in Procedia Computer Science Vol. 4, p. 46-55
- Full Text:
- Reviewed:
- Description: Ant-based clustering (ABC) is a data clustering approach inspired from cemetery formation activities observed in real ant colonies. Building upon the premise of collective intelligence, such an approach uses multiple ant-like agents and a mixture of heuristics, in order to create systems that are capable of clustering real-world data. Many recently proposed ABC systems have shown competitive results, but these systems are geared towards adding new heuristics, resulting in increasingly complex systems that are harder to understand and improve. In contrast to this direction, we demonstrate that a state-of-the-art ABC system can be systematically evaluated and then simplified. The streamlined model, which we call SABC, differs fundamentally from traditional ABC systems as it does not use the ant-colony and several key components. Yet, our empirical study shows that SABC performs more effectively and effciently than the state-of-the-art ABC system.
Twin removal in genetic algorithms for protein structure prediction using low-resolution model
- Authors: Hoque, Md Tamjidul , Chetty, Madhu , Lewis, Andrew , Sattar, Abdul
- Date: 2011
- Type: Text , Journal article
- Relation: IEEE/ACM Transactions on Computational Biology and Bioinformatics Vol. 8, no. 1 (2011), p. 234-245
- Full Text: false
- Reviewed:
- Description: This paper presents the impact of twins and the measures for their removal from the population of genetic algorithm (GA) when applied to effective conformational searching. It is conclusively shown that a twin removal strategy for a GA provides considerably enhanced performance when investigating solutions to complex ab initio protein structure prediction (PSP) problems in low-resolution model. Without twin removal, GA crossover and mutation operations can become ineffectual as generations lose their ability to produce significant differences, which can lead to the solution stalling. The paper relaxes the definition of chromosomal twins in the removal strategy to not only encompass identical, but also highly correlated chromosomes within the GA population, with empirical results consistently exhibiting significant improvements solving PSP problems.