Your selections:

2Bayesian networks
10101 Pure Mathematics
1Algorithms
1Bayesian network
1Bayesian network classifiers
1Classifiers
1Conditional probabilities
1Correlation
1Data classification problems
1Data mining
1Descent direction
1Diseases
1Hospitals
1Independence assumption
1Information technology
1K-dependency bayesian networks
1Learning systems
1Line search
1Mathematical model
1Naive Bayes

Show More

Show Less

Format Type

Target learning : A novel framework to mine significant dependencies for unlabeled data

- Wang, Limin, Chen, Shenglei, Mammadov, Musa

**Authors:**Wang, Limin , Chen, Shenglei , Mammadov, Musa**Date:**2018**Type:**Text , Conference proceedings**Relation:**22nd Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD 2018; Melbourne, Australia; 3rd-6th June 2018; published in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 10937 LNAI, p. 106-117**Full Text:**false**Reviewed:****Description:**To mine significant dependencies among predictiveattributes, much work has been carried out to learn Bayesian netwrok classifiers (BNC T s) from labeled training data set T. However, if BNC T does not capture the “right” dependencies that would be most relevant to unlabeled testing instance, that will result in performance degradation. To address this issue we propose a novel framework, called target learning, that takes each unlabeled testing instance as a target and builds an “unstable” Bayesian model BNC P for it. To make BNC P and BNC T complementary to each other and work efficiently in combination, the same learning strategy is applied to build them. Experimental comparison on 32 large data sets from UCI machine learning repository shows that, for BNCs with different degrees of dependence target learning always helps improve the generalization performance with minimal additional computation.**Description:**Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Predicting and controlling the dynamics of infectious diseases

- Evans, Robin, Mammadov, Musa

**Authors:**Evans, Robin , Mammadov, Musa**Date:**2015**Type:**Text , Conference proceedings**Relation:**54th IEEE Conference on Decision and Control, CDC 2015; Osaka, Japan; 15th-18th December 2015; Published in Proceedings of the IEEE Conference on Decision and Control; p. 5378-5383**Full Text:****Description:**This paper introduces a new optimal control model to describe and control the dynamics of infectious diseases. In the present model, the average time to isolation (i.e. hospitalization) of infectious population is the main time-dependent parameter that defines the spread of infection. All the preventive measures aim to decrease the average time to isolation under given constraints. The model suggested allows one to generate a small number of possible future scenarios and to determine corresponding trajectories of infected population in different regions. Then, this information is used to find an optimal distribution of bed capabilities across countries/regions according to each scenario. © 2015 IEEE.

**Authors:**Evans, Robin , Mammadov, Musa**Date:**2015**Type:**Text , Conference proceedings**Relation:**54th IEEE Conference on Decision and Control, CDC 2015; Osaka, Japan; 15th-18th December 2015; Published in Proceedings of the IEEE Conference on Decision and Control; p. 5378-5383**Full Text:****Description:**This paper introduces a new optimal control model to describe and control the dynamics of infectious diseases. In the present model, the average time to isolation (i.e. hospitalization) of infectious population is the main time-dependent parameter that defines the spread of infection. All the preventive measures aim to decrease the average time to isolation under given constraints. The model suggested allows one to generate a small number of possible future scenarios and to determine corresponding trajectories of infected population in different regions. Then, this information is used to find an optimal distribution of bed capabilities across countries/regions according to each scenario. © 2015 IEEE.

Structure learning of Bayesian networks using a new unrestricted dependency algorithm

- Taheri, Sona, Mammadov, Musa

**Authors:**Taheri, Sona , Mammadov, Musa**Date:**2012**Type:**Text , Conference proceedings**Full Text:****Description:**Bayesian Networks have deserved extensive attentions in data mining due to their efficiencies, and reasonable predictive accuracy. A Bayesian Network is a directed acyclic graph in which each node represents a variable and each arc a probabilistic dependency between two variables. Constructing a Bayesian Network from data is the learning process that is divided in two steps: learning structure and learning parameter. In many domains, the structure is not known a priori and must be inferred from data. This paper presents an iterative unrestricted dependency algorithm for learning structure of Bayesian Networks for binary classification problems. Numerical experiments are conducted on several real world data sets, where continuous features are discretized by applying two different methods. The performance of the proposed algorithm is compared with the Naive Bayes, the Tree Augmented Naive Bayes, and the k

**Authors:**Taheri, Sona , Mammadov, Musa**Date:**2012**Type:**Text , Conference proceedings**Full Text:****Description:**Bayesian Networks have deserved extensive attentions in data mining due to their efficiencies, and reasonable predictive accuracy. A Bayesian Network is a directed acyclic graph in which each node represents a variable and each arc a probabilistic dependency between two variables. Constructing a Bayesian Network from data is the learning process that is divided in two steps: learning structure and learning parameter. In many domains, the structure is not known a priori and must be inferred from data. This paper presents an iterative unrestricted dependency algorithm for learning structure of Bayesian Networks for binary classification problems. Numerical experiments are conducted on several real world data sets, where continuous features are discretized by applying two different methods. The performance of the proposed algorithm is compared with the Naive Bayes, the Tree Augmented Naive Bayes, and the k

A globally optimization algorithm for systems of nonlinear equations

- Mammadov, Musa, Taheri, Sona

**Authors:**Mammadov, Musa , Taheri, Sona**Date:**2010**Type:**Text , Conference proceedings**Full Text:**false**Description:**In this paper, a new algorithm is proposed for the solutions of system of nonlinear equations. This algorithm uses a combination of the gradient and Newton's methods. A novel dynamic combinator is developed to determine the contribution of the methods in the combination. Also, by using some parameters in the proposed algorithm, this contribution is adjusted. The efficiency of the algoritms is studied in solving system of nonlinear equations.

Global stability, periodic solutions and optimal control in a nonlinear differential delay model

- Ivanov, Anatoli, Mammadov, Musa

**Authors:**Ivanov, Anatoli , Mammadov, Musa**Date:**2010**Type:**Text , Conference proceedings**Relation:**Eighth Mississippi State - UAB Conference on Differential Equations and Computational Simulations, 2010**Full Text:**false**Description:**A nonlinear differential equation with delay serving as a mathematical model of several applied problmes is considered. Sufficient conditions for the global asymptotic stability and for the existence of periodic solutions are given. Two particular applications are treated in detail. The first one is a blood cell production model by Mackey, for which new periodicity criteria are derived. The second application is a modified economic model with delay due to Ramsay. An optimization problem for a maximal consumption is stated and solved for the latter.

**Authors:**Ivanov, Anatoli , Mammadov, Musa**Date:**2010**Type:**Text , Conference proceedings**Relation:**Eighth Mississippi State - UAB Conference on Differential Equations and Computational Simulations, 2010**Full Text:**false**Description:**A nonlinear differential equation with delay serving as a mathematical model of several applied problmes is considered. Sufficient conditions for the global asymptotic stability and for the existence of periodic solutions are given. Two particular applications are treated in detail. The first one is a blood cell production model by Mackey, for which new periodicity criteria are derived. The second application is a modified economic model with delay due to Ramsay. An optimization problem for a maximal consumption is stated and solved for the latter.

Improving Naive Bayes classifier using conditional probabilities

- Taheri, Sona, Mammadov, Musa, Bagirov, Adil

**Authors:**Taheri, Sona , Mammadov, Musa , Bagirov, Adil**Date:**2010**Type:**Text , Conference proceedings**Full Text:****Description:**Naive Bayes classifier is the simplest among Bayesian Network classifiers. It has shown to be very efficient on a variety of data classification problems. However, the strong assumption that all features are conditionally independent given the class is often violated on many real world applications. Therefore, improvement of the Naive Bayes classifier by alleviating the feature independence assumption has attracted much attention. In this paper, we develop a new version of the Naive Bayes classifier without assuming independence of features. The proposed algorithm approximates the interactions between features by using conditional probabilities. We present results of numerical experiments on several real world data sets, where continuous features are discretized by applying two different methods. These results demonstrate that the proposed algorithm significantly improve the performance of the Naive Bayes classifier, yet at the same time maintains its robustness. © 2011, Australian Computer Society, Inc.**Description:**2003009505

**Authors:**Taheri, Sona , Mammadov, Musa , Bagirov, Adil**Date:**2010**Type:**Text , Conference proceedings**Full Text:****Description:**Naive Bayes classifier is the simplest among Bayesian Network classifiers. It has shown to be very efficient on a variety of data classification problems. However, the strong assumption that all features are conditionally independent given the class is often violated on many real world applications. Therefore, improvement of the Naive Bayes classifier by alleviating the feature independence assumption has attracted much attention. In this paper, we develop a new version of the Naive Bayes classifier without assuming independence of features. The proposed algorithm approximates the interactions between features by using conditional probabilities. We present results of numerical experiments on several real world data sets, where continuous features are discretized by applying two different methods. These results demonstrate that the proposed algorithm significantly improve the performance of the Naive Bayes classifier, yet at the same time maintains its robustness. © 2011, Australian Computer Society, Inc.**Description:**2003009505

Regularization methods in the study of drug reaction relationships

- Mammadov, Musa, Zhao, Lei, Zhang, Jianjun

**Authors:**Mammadov, Musa , Zhao, Lei , Zhang, Jianjun**Date:**2010**Type:**Text , Conference proceedings**Full Text:**false

- «
- ‹
- 1
- ›
- »

Are you sure you would like to clear your session, including search history and login status?