Yetian Chen

Learn More
In this work, we proposed using Bayesian Networks and Bayesian Model Averaging to address the problem of predicting the cellular localization site of a protein from the its amino acid sequence. We employed the constraint-based algorithm and score-based algorithm to learn a single Bayesian network from data and then used this single Bayesian network for(More)
In this paper, we describe the implementation of a set of machine learning techniques: Decision Tree, Perceptrons, Two-layer feed-forward Neural Networks. We describe the application of these techniques to the problem of classifying proteins into their various cellular localization sites based on their amino acid sequences. We evaluate the performance of(More)
We develop an algorithm to find the k-best equivalence classes of Bayesian networks. Our algorithm is capable of finding much more best DAGs than the previous algorithm that directly finds the k-best DAGs [1]. We demonstrate our algorithm in the task of Bayesian model averaging. Empirical results show that our algorithm significantly outperforms the k-best(More)
Bayesian network (BN) classifiers with powerful reasoning capabilities have been increasingly utilized to detect intrusion with reasonable accuracy and efficiency. However, existing BN classifiers for intrusion detection suffer two problems. First, such BN classifiers are often trained from data using heuristic methods that usually select suboptimal models.(More)
Exact Bayesian structure discovery in Bayesian networks requires exponential time and space. Using dynamic programming (DP), the fastest known serial algorithm computes the exact posterior probabilities of structural features in O(n2 n) time and space, if the number of parents per node or indegree is bounded by a constant d. Here we present a parallel(More)
Ancestor relations in Bayesian networks (BNs) encode long-range causal relations among random variables. In this paper, we develop dynamic programming (DP) algorithms to compute the exact posterior probabilities of ancestor relations in Bayesian networks. Previous algorithm by Parviainen and Koivisto (2011) evaluates all possible ancestor relations in time(More)
Skill prerequisite information is useful for tutoring systems that assess student knowledge or that provide remediation. These systems often encode prerequisites as graphs designed by subject matter experts in a costly and time-consuming process. In this paper, we introduce Combined student Modeling and prerequisite Discovery (COMMAND), a novel algorithm(More)
High level security maintenance is very important nowadays for safe and trusted communication over the internet but due to enormous interconnectivity this task has become very complex. Threat of intrusions and misuses is always present in communication over the internet and any other network. These intrusions are occurring at higher rates than before and(More)
Introduction Bayesian Network (BN) A directed acyclic graph (DAG) where nodes are random variables and directed edges represent probability dependencies among variables BN Structure Learning Firstly construct the topology (structure) of the network Then estimate the parameters (CPDs) given the fixed structure Curriculum Learning (CL) Ideas: learn with the(More)