Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Tree structure

Known as: Child node (of a tree), Rooted hierarchical tree structure, Tree (disambiguation) 
A tree structure or tree diagram is a way of representing the hierarchical nature of a structure in a graphical form. It is named a "tree structure… Expand
Wikipedia

Related topics

Related topics

50 relations
AVL treeArgument mapAutomatic taxonomy constructionBacktracking
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Tree-Guided Group Lasso for Multi-Task Regression with Structured Sparsity
We consider the problem of learning a sparse multi-task regression, where the structure in the outputs can be represented as a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases
Recently, high utility pattern (HUP) mining is one of the most important research issues in data mining due to its ability to… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The TV-tree: An index structure for high-dimensional data
We propose a file structure to index high-dimensionality data, which are typically points in some feature space. The idea is to… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Design and analysis of an MST-based topology control algorithm
In this paper, we present a minimum spanning tree (MST)-based algorithm, called local minimum spanning tree (LMST), for topology… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Bayesian Network Classifiers
Recent work in supervised learning has shown that a surprisingly simple Bayesian classifier with strong assumptions of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The global k-means clustering algorithm
We present the global k-means algorithm which is an incremental approach to clustering that dynamically adds one cluster center… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Adapting the Sample Size in Particle Filters Through KLD-Sampling
  • D. Fox
  • Int. J. Robotics Res.
  • 2003
    • Corpus ID: 3037676
Over the past few years, particle filters have been applied with great success to a variety of state estimation problems. In this… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems
Ordered labeled trees are trees in which the left-to-right order among siblings is significant. The distance between two ordered… Expand
  • figure 5
  • figure 6
  • figure 7
  • figure 8
  • figure 9
Is this relevant?
Highly Cited
1980
Highly Cited
1980
On visible surface generation by a priori tree structures
This paper describes a new algorithm for solving the hidden surface (or line) problem, to more rapidly generate realistic images… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 9
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE