搜索结果: 1-15 共查到“知识库 管理学 trees”相关记录29条 . 查询时间(0.114 秒)
Focusing on Lone Trees in the Forest:Members' Experience of a Multiple Identity Organization
Employees
font style='font-size:12px;'>
2015/5/13
Focusing on Lone Trees in the Forest:Members' Experience of a Multiple Identity Organization.
Alternating Decision trees for early diagnosis of dengue fever
Alternating Decision trees early diagnosis dengue fever
font style='font-size:12px;'>
2013/6/17
Dengue fever is a flu-like illness spread by the bite of an infected mosquito which is fast emerging as a major health problem. Timely and cost effective diagnosis using clinical and laboratory featur...
Computing the posterior expectation of phylogenetic trees
Bayesian statistics BHV tree space Frechet mean geometric median phylogenetic trees posterior expectation
font style='font-size:12px;'>
2013/6/14
Inferring phylogenetic trees from multiple sequence alignments often relies upon Markov chain Monte Carlo (MCMC) methods to generate tree samples from a posterior distribution. To give a rigorous appr...
Random Intersection Trees
High-dimensional classication Interactions Min-wise hashing Sparse data
font style='font-size:12px;'>
2013/4/28
Finding interactions between variables in large and high-dimensional datasets is often a serious computational challenge. Most approaches build up interaction sets incrementally, adding variables in a...
Personalized News Recommendation with Context Trees
Personalized News Recommendation Context Trees
font style='font-size:12px;'>
2013/4/28
The profusion of online news articles makes it difficult to find interesting articles, a problem that can be assuaged by using a recommender system to bring the most relevant news stories to readers. ...
Top-down particle filtering for Bayesian decision trees
Top-down particle filtering Bayesian decision trees
font style='font-size:12px;'>
2013/4/27
Decision tree learning is a popular approach for classification and regression in machine learning and statistics, and Bayesian formulations---which introduce a prior distribution over decision trees,...
From Fields to Trees
From Fields Trees
font style='font-size:12px;'>
2012/9/19
We present new MCMC algo rithms for com-puting the posterior distri but ionsandexpec-tations of the unknownvari ables in undi-rected grap hical model swi thre gular struc ture. For demon stration pu r...
Identifying subtree perfectness in decision trees
Choice function subtree perfectness backward induction sequential decision tree consequentialist maximality maximin E-admissibility imprecise probability imprecise utility.
font style='font-size:12px;'>
2012/9/17
In decision problems, often, utilities and probabilities are hard to determine. In such cases, one can resort to so-called choice functions. They provide a means to determine which options in a partic...
Branching Markov processes on fragmentation trees generated from the paintbox process
paintbox process Markov processes
font style='font-size:12px;'>
2011/7/19
A fragmentation of a set $A$ is a graph with vertices labeled by subsets of $A$ which obey a certain parent-child relationship. A random fragmentation tree is a probability distribution on the space o...
Pitman-Yor Diffusion Trees
Pitman-Yor Diffusion Trees
font style='font-size:12px;'>
2011/7/5
We introduce the Pitman Yor Diffusion Tree (PYDT) for hierarchical clustering, a generalization of the Dirichlet Diffusion Tree (Neal, 2001) which removes the restriction to binary branching structure...
Error Probability Bounds for Balanced Binary Relay Trees
Binary relay tree distributed detection decentralized detection hypothesis testing information fusion dynamic system invariant region error probability decay rate sensor network
font style='font-size:12px;'>
2011/6/21
We study the detection error probability associated with a balanced binary relay tree, where the leaves of
the tree correspond to N identical and independent detectors. The root of the tree represent...
Pruning nearest neighbor cluster trees
cluster trees cluster structure subgraphs of a k-NN graph
font style='font-size:12px;'>
2011/6/16
Nearest neighbor (k-NN) graphs are widely used
in machine learning and data mining applications,
and our aim is to better understand what
they reveal about the cluster structure of the unknown
und...
Coupling optional Pólya trees and the two sample problem
Coupling optional Pólya trees the two sample problem
font style='font-size:12px;'>
2010/11/9
Testing and characterizing the difference between two data samples is of fundamen-tal interest in statistics. Existing methods such as Kolmogorov-Smirnov and Cramer-von-Mises tests do not scale well a...
Improving the precision of classification trees
Bagging kernel density discrimination nearest neighbor pre-diction random forest
font style='font-size:12px;'>
2010/11/8
Besides serving as prediction models, classification trees are use-ful for finding important predictor variables and identifying inter-esting subgroups in the data. These functions can be compromised ...
Visualizing the Structure of Large Trees
Visualizing Structure Large Trees
font style='font-size:12px;'>
2010/3/9
This study introduces a new method of visualizing complex tree
structured objects. The usefulness of this method is illustrated in the
context of detecting unexpected features in a data set of very ...