Terran Lane
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Terran Lane has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Benjamin Yackley
Department of Computer Science University of New Mexico 87131 Albuquerque NM
2 shared publications - Shibin Qiu
Pathwork Diagnostics, Inc, Sunnyvale, Sunnyvale, CA 94089, USA
2 shared publications - Blake Anderson
Los Alamos National Laboratory, Los Alamos, NM
1 shared publication Coen M Adema
1 shared publication- Cristopher Moore
Santa Fe Institute
1 shared publication - Cundong Yang
University of New Mexico
1 shared publication
Latest Publications
- 12 January 2016
- Vol. 2012, 1663-1670
Smoothness and Structure Learning by Proxy
As data sets grow in size, the ability of learning methods to find structure in them is increasingly hampered by the time needed to search the large spaces of possibilities and generate a score for each that takes all of the observed data into account. For instance, Bayesian networks, the model chosen in this paper, have a super-exponentially large search space for a fixed number of variables. One possible method to alleviate this problem is to use a proxy, such as a Gaussian Process regressor, in place of the true scoring function, training it on a selection of sampled networks. We prove here that the use of such a proxy is well-founded, as we can bound the smoothness of a commonly-used scoring function for Bayesian network structure learning. We show here that, compared to an identical search strategy using the network's exact scores, our proxy-based search is able to get equivalent or better scores on a number of data sets in a fraction of the time.
- 12 January 2016
- Vol. 2012, 1663-1670
Smoothness and Structure Learning by Proxy
As data sets grow in size, the ability of learning methods to find structure in them is increasingly hampered by the time needed to search the large spaces of possibilities and generate a score for each that takes all of the observed data into account. For instance, Bayesian networks, the model chosen in this paper, have a super-exponentially large search space for a fixed number of variables. One possible method to alleviate this problem is to use a proxy, such as a Gaussian Process regressor, in place of the true scoring function, training it on a selection of sampled networks. We prove here that the use of such a proxy is well-founded, as we can bound the smoothness of a commonly-used scoring function for Bayesian network structure learning. We show here that, compared to an identical search strategy using the network's exact scores, our proxy-based search is able to get equivalent or better scores on a number of data sets in a fraction of the time.
- Open Access
Smoothness and Structure Learning by Proxy
As data sets grow in size, the ability of learning methods to find structure in them is increasingly hampered by the time needed to search the large spaces of possibilities and generate a score for each that takes all of the observed data into account. For instance, Bayesian networks, the model chosen in this paper, have a super-exponentially large search space for a fixed number of variables. One possible method to alleviate this problem is to use a proxy, such as a Gaussian Process regressor, in place of the true scoring function, training it on a selection of sampled networks. We prove here that the use of such a proxy is well-founded, as we can bound the smoothness of a commonly-used scoring function for Bayesian network structure learning. We show here that, compared to an identical search strategy using the network?s exact scores, our proxy-based search is able to get equivalent or better scores on a number of data sets in a fraction of the time.
Open AccessSmoothness and Structure Learning by Proxy
As data sets grow in size, the ability of learning methods to find structure in them is increasingly hampered by the time needed to search the large spaces of possibilities and generate a score for each that takes all of the observed data into account. For instance, Bayesian networks, the model chosen in this paper, have a super-exponentially large search space for a fixed number of variables. One possible method to alleviate this problem is to use a proxy, such as a Gaussian Process regressor, in place of the true scoring function, training it on a selection of sampled networks. We prove here that the use of such a proxy is well-founded, as we can bound the smoothness of a commonly-used scoring function for Bayesian network structure learning. We show here that, compared to an identical search strategy using the network?s exact scores, our proxy-based search is able to get equivalent or better scores on a number of data sets in a fraction of the time.
- Open Access
Active Learning for Node Classification in Assortative and Disassortative Networks
In many real-world networks, nodes have class labels, attributes, or variables that affect the network's topology. If the topology of the network is known but the labels of the nodes are hidden, we would like to select a small subset of nodes such that, if we knew their labels, we could accurately predict the labels of all the other nodes. We develop an active learning algorithm for this problem which uses information-theoretic techniques to choose which nodes to explore. We test our algorithm on networks from three different domains: a social network, a network of English words that appear adjacently in a novel, and a marine food web. Our algorithm makes no initial assumptions about how the groups connect, and performs well even when faced with quite general types of network structure. In particular, we do not assume that nodes of the same class are more likely to be connected to each other---only that they connect to the rest of the network in similar ways.
Open AccessActive Learning for Node Classification in Assortative and Disassortative Networks
In many real-world networks, nodes have class labels, attributes, or variables that affect the network's topology. If the topology of the network is known but the labels of the nodes are hidden, we would like to select a small subset of nodes such that, if we knew their labels, we could accurately predict the labels of all the other nodes. We develop an active learning algorithm for this problem which uses information-theoretic techniques to choose which nodes to explore. We test our algorithm on networks from three different domains: a social network, a network of English words that appear adjacently in a novel, and a marine food web. Our algorithm makes no initial assumptions about how the groups connect, and performs well even when faced with quite general types of network structure. In particular, we do not assume that nodes of the same class are more likely to be connected to each other---only that they connect to the rest of the network in similar ways.
- Top Cited Papers
- 8 June 2011
- Published by Springer Nature in Journal of Computer Virology and Hacking Techniques
- Vol. 7 (4) , 247-258
Graph-based malware detection using dynamic analysis
- 8 June 2011
- Published by Springer Nature in Journal of Computer Virology and Hacking Techniques
- Vol. 7 (4) , 247-258
Top Cited PapersGraph-based malware detection using dynamic analysis
- Open Access
Directional Statistics on Permutations
Distributions over permutations arise in applications ranging from multi-object tracking to ranking of instances. The difficulty of dealing with these distributions is caused by the size of their domain, which is factorial in the number of considered entities ($n!$). It makes the direct definition of a multinomial distribution over permutation space impractical for all but a very small $n$. In this work we propose an embedding of all $n!$ permutations for a given $n$ in a surface of a hypersphere defined in $\mathbbm{R}^{(n-1)^2}$. As a result of the embedding, we acquire ability to define continuous distributions over a hypersphere with all the benefits of directional statistics. We provide polynomial time projections between the continuous hypersphere representation and the $n!$-element permutation space. The framework provides a way to use continuous directional probability densities and the methods developed thereof for establishing densities over permutations. As a demonstration of the benefits of the framework we derive an inference procedure for a state-space model over permutations. We demonstrate the approach with applications.Open AccessDirectional Statistics on Permutations
Distributions over permutations arise in applications ranging from multi-object tracking to ranking of instances. The difficulty of dealing with these distributions is caused by the size of their domain, which is factorial in the number of considered entities ($n!$). It makes the direct definition of a multinomial distribution over permutation space impractical for all but a very small $n$. In this work we propose an embedding of all $n!$ permutations for a given $n$ in a surface of a hypersphere defined in $\mathbbm{R}^{(n-1)^2}$. As a result of the embedding, we acquire ability to define continuous distributions over a hypersphere with all the benefits of directional statistics. We provide polynomial time projections between the continuous hypersphere representation and the $n!$-element permutation space. The framework provides a way to use continuous directional probability densities and the methods developed thereof for establishing densities over permutations. As a demonstration of the benefits of the framework we derive an inference procedure for a state-space model over permutations. We demonstrate the approach with applications. - Open Access
- 14 June 2009
- Published by Association for Computing Machinery (ACM)
- Vol. 382, 905-912
Learning structurally consistent undirected probabilistic graphical models
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the statistical dependency structure than directed graphical models. Unfortunately, structure learning of undirected graphs using likelihood-based scores remains difficult because of the intractability of computing the partition function. We describe a new Markov random field structure learning algorithm, motivated by canonical parameterization of Abbeel et al. We provide computational improvements on their parameterization by learning per-variable canonical factors, which makes our algorithm suitable for domains with hundreds of nodes. We compare our algorithm against several algorithms for learning undirected and directed models on simulated and real datasets from biology. Our algorithm frequently outperforms existing algorithms, producing higher-quality structures, suggesting that enforcing consistency during structure learning is beneficial for learning undirected graphs.
- 14 June 2009
- Published by Association for Computing Machinery (ACM)
- Vol. 382, 905-912
Open AccessLearning structurally consistent undirected probabilistic graphical models
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the statistical dependency structure than directed graphical models. Unfortunately, structure learning of undirected graphs using likelihood-based scores remains difficult because of the intractability of computing the partition function. We describe a new Markov random field structure learning algorithm, motivated by canonical parameterization of Abbeel et al. We provide computational improvements on their parameterization by learning per-variable canonical factors, which makes our algorithm suitable for domains with hundreds of nodes. We compare our algorithm against several algorithms for learning undirected and directed models on simulated and real datasets from biology. Our algorithm frequently outperforms existing algorithms, producing higher-quality structures, suggesting that enforcing consistency during structure learning is beneficial for learning undirected graphs.
- 31 December 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 6 (2) , 190-199
A Framework for Multiple Kernel Support Vector Regression and Its Applications to siRNA Efficacy Prediction
The cell defense mechanism of RNA interference has applications in gene function analysis and promising potentials in human disease therapy. To effectively silence a target gene, it is desirable to select appropriate initiator siRNA molecules having satisfactory silencing capabilities. Computational prediction for silencing efficacy of siRNAs can assist this screening process before using them in biological experiments. String kernel functions, which operate directly on the string objects representing siRNAs and target mRNAs, have been applied to support vector regression for the prediction and improved accuracy over numerical kernels in multidimensional vector spaces constructed from descriptors of siRNA design rules. To fully utilize information provided by string and numerical data, we propose to unify the two in a kernel feature space by devising a multiple kernel regression framework where a linear combination of the kernels is used. We formulate the multiple kernel learning into a quadratically constrained quadratic programming (QCQP) problem, which although yields global optimal solution, is computationally demanding and requires a commercial solver package. We further propose three heuristics based on the principle of kernel-target alignment and predictive accuracy. Empirical results demonstrate that multiple kernel regression can improve accuracy, decrease model complexity by reducing the number of support vectors, and speed up computational performance dramatically. In addition, multiple kernel regression evaluates the importance of constituent kernels, which for the siRNA efficacy prediction problem, compares the relative significance of the design rules. Finally, we give insights into the multiple kernel regression mechanism and point out possible extensions.
- 31 December 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 6 (2) , 190-199
A Framework for Multiple Kernel Support Vector Regression and Its Applications to siRNA Efficacy Prediction
The cell defense mechanism of RNA interference has applications in gene function analysis and promising potentials in human disease therapy. To effectively silence a target gene, it is desirable to select appropriate initiator siRNA molecules having satisfactory silencing capabilities. Computational prediction for silencing efficacy of siRNAs can assist this screening process before using them in biological experiments. String kernel functions, which operate directly on the string objects representing siRNAs and target mRNAs, have been applied to support vector regression for the prediction and improved accuracy over numerical kernels in multidimensional vector spaces constructed from descriptors of siRNA design rules. To fully utilize information provided by string and numerical data, we propose to unify the two in a kernel feature space by devising a multiple kernel regression framework where a linear combination of the kernels is used. We formulate the multiple kernel learning into a quadratically constrained quadratic programming (QCQP) problem, which although yields global optimal solution, is computationally demanding and requires a commercial solver package. We further propose three heuristics based on the principle of kernel-target alignment and predictive accuracy. Empirical results demonstrate that multiple kernel regression can improve accuracy, decrease model complexity by reducing the number of support vectors, and speed up computational performance dramatically. In addition, multiple kernel regression evaluates the importance of constituent kernels, which for the siRNA efficacy prediction problem, compares the relative significance of the design rules. Finally, we give insights into the multiple kernel regression mechanism and point out possible extensions.
- Open Access
- 8 April 2008
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 24 (10) , 1318-1320
A system for generating transcription regulatory networks with combinatorial control of transcription
Summary: We have developed a new software system, REgulatory Network generator with COmbinatorial control (RENCO), for automatic generation of differential equations describing pre-transcriptional combinatorics in artificial regulatory networks. RENCO has the following benefits: (a) it explicitly models protein–protein interactions among transcription factors, (b) it captures combinatorial control of transcription factors on target genes and (c) it produces output in Systems Biology Markup Language (SBML) format, which allows these equations to be directly imported into existing simulators. Explicit modeling of the protein interactions allows RENCO to incorporate greater mechanistic detail of the transcription machinery compared to existing models and can provide a better assessment of algorithms for regulatory network inference. Availability: RENCO is a C++ command line program, available at http://sourceforge.net/projects/renco/ Contact: terran@cs.unm.edu Supplementary information: Supplementary data are available at Bioinformatics online.
- 8 April 2008
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 24 (10) , 1318-1320
Open AccessA system for generating transcription regulatory networks with combinatorial control of transcription
Summary: We have developed a new software system, REgulatory Network generator with COmbinatorial control (RENCO), for automatic generation of differential equations describing pre-transcriptional combinatorics in artificial regulatory networks. RENCO has the following benefits: (a) it explicitly models protein–protein interactions among transcription factors, (b) it captures combinatorial control of transcription factors on target genes and (c) it produces output in Systems Biology Markup Language (SBML) format, which allows these equations to be directly imported into existing simulators. Explicit modeling of the protein interactions allows RENCO to incorporate greater mechanistic detail of the transcription machinery compared to existing models and can provide a better assessment of algorithms for regulatory network inference. Availability: RENCO is a C++ command line program, available at http://sourceforge.net/projects/renco/ Contact: terran@cs.unm.edu Supplementary information: Supplementary data are available at Bioinformatics online.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 307-314
The RNA String Kernel for siRNA Efficacy Prediction
String kernels directly model sequence similarities without the necessity of extracting numerical features in a vector space. Since they better capture complex traits in the sequences, string kernels often achieve better prediction performance. RNA interference is a cell defense mechanism with many biological and therapeutical applications, where strings can be used to represent target messenger RNAs and initiating short RNAs and string kernels can be applied for training and prediction. While most existing string kernels are developed for general purpose sequences and have been applied to text and protein classifications, the RNA string kernel is particularly designed to model mismatches, GU wobbles, and bulges of RNA biology and has been applied to RNAi off-target evaluation. We adapt the RNA string kernel to compute the similarity of siRNA sequences and use it in support vector regression to predict siRNA silencing efficacy. We evaluate the performance of the RNA kernel against the spectrum kernel, the string subsequence kernel of arbitrary mismatch, the randomized string kernel, and numerical kernels computed from numerical features extracted according to siRNA design rules. We also give insights into computational performance and common properties and differences of the RNA kernel as compared to other kernels. Empirical results on biological data sets demonstrate that the RNA string kernel performed favorably than most existing string kernels and achieved significant improvements over kernels computed from numerical descriptors extracted according to structural and thermodynamic rules. Meanwhile, the string kernels achieved favorable results relative to other methods in related work. Furthermore, the RNA string kernel is simple to implement and fast to compute.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 307-314
The RNA String Kernel for siRNA Efficacy Prediction
String kernels directly model sequence similarities without the necessity of extracting numerical features in a vector space. Since they better capture complex traits in the sequences, string kernels often achieve better prediction performance. RNA interference is a cell defense mechanism with many biological and therapeutical applications, where strings can be used to represent target messenger RNAs and initiating short RNAs and string kernels can be applied for training and prediction. While most existing string kernels are developed for general purpose sequences and have been applied to text and protein classifications, the RNA string kernel is particularly designed to model mismatches, GU wobbles, and bulges of RNA biology and has been applied to RNAi off-target evaluation. We adapt the RNA string kernel to compute the similarity of siRNA sequences and use it in support vector regression to predict siRNA silencing efficacy. We evaluate the performance of the RNA kernel against the spectrum kernel, the string subsequence kernel of arbitrary mismatch, the randomized string kernel, and numerical kernels computed from numerical features extracted according to siRNA design rules. We also give insights into computational performance and common properties and differences of the RNA kernel as compared to other kernels. Empirical results on biological data sets demonstrate that the RNA string kernel performed favorably than most existing string kernels and achieved significant improvements over kernels computed from numerical descriptors extracted according to structural and thermodynamic rules. Meanwhile, the string kernels achieved favorable results relative to other methods in related work. Furthermore, the RNA string kernel is simple to implement and fast to compute.
- 7 April 2007
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 42 (3) , 303-319
Efficient search algorithms for RNAi target detection
- 7 April 2007
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 42 (3) , 303-319
Efficient search algorithms for RNAi target detection