共查询到20条相似文献,搜索用时 0 毫秒
1.
Michalis Christou Maxime Crochemore Tomáš Flouri Costas S. Iliopoulos Jan Janoušek Bořivoj Melichar Solon P. Pissis 《Information Processing Letters》2012,112(24):958-962
We consider the problem of computing all subtree repeats in a given labeled ordered tree. We first transform the tree to a string representing its postfix notation, and then present an algorithm based on the bottom-up technique to solve it. The proposed algorithm consists of two phases: the preprocessing phase and the phase where all subtree repeats are computed. The linear time and space complexity of the proposed algorithm are important parts of its quality. 相似文献
2.
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There exists a well-studied process of closure-based data mining in the itemset framework: we consider the extension of this process into trees. We focus mostly on the case where labels on the nodes are nonexistent or unreliable, and discuss algorithms for closure-based mining that only rely on the root of the tree and the link structure. We provide a notion of intersection that leads to a deeper understanding of the notion of support-based closure, in terms of an actual closure operator. We describe combinatorial characterizations and some properties of ordered trees, discuss their applicability to unordered trees, and rely on them to design efficient algorithms for mining frequent closed subtrees both in the ordered and the unordered settings. Empirical validations and comparisons with alternative algorithms are provided. 相似文献
3.
Yun Chi Yi Xia Yirong Yang Muntz R.R. 《Knowledge and Data Engineering, IEEE Transactions on》2005,17(2):190-202
Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in mining databases of trees is to find frequently occurring subtrees. Because of the combinatorial explosion, the number of frequent subtrees usually grows exponentially with the size of frequent subtrees and, therefore, mining all frequent subtrees becomes infeasible for large tree sizes. We present CMTreeMiner, a computationally efficient algorithm that discovers only closed and maximal frequent subtrees in a database of labeled rooted trees, where the rooted trees can be either ordered or unordered. The algorithm mines both closed and maximal frequent subtrees by traversing an enumeration tree that systematically enumerates all frequent subtrees. Several techniques are proposed to prune the branches of the enumeration tree that do not correspond to closed or maximal frequent subtrees. Heuristic techniques are used to arrange the order of computation so that relatively expensive computation is avoided as much as possible. We study the performance of our algorithm through extensive experiments, using both synthetic data and data sets from real applications. The experimental results show that our algorithm is very efficient in reducing the search space and quickly discovers all closed and maximal frequent subtrees. 相似文献
4.
5.
The aim of automatic graph drawing is the development of algorithms for creating nice and easily readable layouts of abstractly given graphs. For the special case of rooted trees of unbounded degree, John Q. Walker II presented a drawing algorithm in this journal in 1990. This algorithm is an extension of the Reingold–Tilford algorithm. It yields very good results and is therefore widely used. Furthermore, it is widely assumed to run in linear time, as the author claims in his article. However, the algorithm in its presented form clearly needs quadratic runtime. We explain the reasons for that and state a revised algorithm that creates the same layouts in linear time. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
6.
7.
Given a tree T=(V,E) of n nodes such that each node v is associated with a value-weight pair (val v ,w v ), where value val v is a real number and weight w v is a non-negative integer, the density of T is defined as \(\frac{\sum_{v\in V}{\mathit{val}}_{v}}{\sum_{v\in V}w_{v}}\). A subtree of T is a connected subgraph (V′,E′) of T, where V′?V and E′?E. Given two integers w min? and w max?, the weight-constrained maximum-density subtree problem on T is to find a maximum-density subtree T′=(V′,E′) satisfying w min?≤∑v∈V′ w v ≤w max?. In this paper, we first present an O(w max? n)-time algorithm to find a weight-constrained maximum-density path in a tree T, and then present an O(w max? 2 n)-time algorithm to find a weight-constrained maximum-density subtree in T. Finally, given a node subset S?V, we also present an O(w max? 2 n)-time algorithm to find a weight-constrained maximum-density subtree in T which covers all the nodes in S. 相似文献
8.
9.
Chun-Cheng Lin Hsu-Chun Yen Sheung-Hung Poon Jia-Hao Fan 《Theoretical computer science》2011,412(4-5):430-447
In a balloon drawing of a tree, all the children under the same parent are placed on the circumference of the circle centered at their parent, and the radius of the circle centered at each node along any path from the root reflects the number of descendants associated with the node. Among various styles of tree drawings reported in the literature, the balloon drawing enjoys a desirable feature of displaying tree structures in a rather balanced fashion. For each internal node in a balloon drawing, the ray from the node to each of its children divides the wedge accommodating the subtree rooted at the child into two sub-wedges. Depending on whether the two sub-wedge angles are required to be identical or not, a balloon drawing can further be divided into two types: even sub-wedge and uneven sub-wedge types. In the most general case, for any internal node in the tree there are two dimensions of freedom that affect the quality of a balloon drawing: (1) altering the order in which the children of the node appear in the drawing, and (2) for the subtree rooted at each child of the node, flipping the two sub-wedges of the subtree. In this paper, we give a comprehensive complexity analysis for optimizing balloon drawings of rooted trees with respect to angular resolution, aspect ratio and standard deviation of angles under various drawing cases depending on whether the tree is of even or uneven sub-wedge type and whether (1) and (2) above are allowed. It turns out that some are NP-complete while others can be solved in polynomial time. We also derive approximation algorithms for those that are intractable in general. 相似文献
10.
S. Zaks 《Theoretical computer science》1980,10(1):63-82
We show a one-one correspondence between all the regular binary trees with n internal nodes and certain integer sequences, an algorithm for generating these trees lexicographically, and the ranking function and the corresponding unranking procedure. We then extend the generating algorithm to k-ary trees, and analyze the amount of work done per tree. Relations to existing algorithms are discussed. 相似文献
11.
Dr. R. Kemp 《Computing》1980,25(3):209-232
In this paper we generalize a result of de Bruijn, Knuth und Rice concerning the average height of planted plane trees withn nodes. First we compute the number of allr-typly rooted planted plane trees (r-trees) withn nodes and height less than or equal tok. Assuming that all planted plane trees withn nodes are equally likely, we show, that in the average a planted plane tree is a 3-tree for largen; for this distribution we compute also the cumulative distribution function and the variance. Finally, we shall derive an exact expression and its asymptotic equivalent for the average height \(\bar h_r \) (n) of anr-tree withn nodes. We obtain for all ε>0 $$\bar h_r (n) = \sqrt {\pi n} - \frac{1}{2}(r - 2) + O(1n(n)/n^{1/2 - \varepsilon } ).$$ 相似文献
12.
13.
Canonical forms for labelled trees and their applications in frequent subtree mining 总被引:1,自引:0,他引:1
Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. In this paper, we first present two canonical forms for labelled rooted unordered trees–the breadth-first canonical form (BFCF) and the depth-first canonical form (DFCF). Then the canonical forms are applied to the frequent subtree mining problem. Based on the BFCF, we develop a vertical mining algorithm, RootedTreeMiner, to discover all frequently occurring subtrees in a database of labelled rooted unordered trees. The RootedTreeMiner algorithm uses an enumeration tree to enumerate all (frequent) labelled rooted unordered subtrees. Next, we extend the definition of the DFCF to labelled free trees and present an Apriori-like algorithm, FreeTreeMiner, to discover all frequently occurring subtrees in a database of labelled free trees. Finally, we study the performance and the scalability of our algorithms through extensive experiments based on both synthetic data and datasets from real applications. 相似文献
14.
We present a polynomial time 1.5h-approximation algorithm for the problem of finding the largest common subtree between two rooted, labeled, and unordered trees of height at most h, where a tree S is called a subtree of a tree T if S is obtained from T by deletion of some nodes in T. This result improves the previous 2h-approximation algorithm. 相似文献
15.
16.
在对XML数据模型和XML查询语言中的顺序性进行分析的基础上,提出了一种用于顺序XML树的前缀编码方法,并从唯一性、确定性、动态性、灵活性和简洁性五个方面论证了这种编码的正确性和有效性;同时,运用分层编码的思想解决当XML文档规模增大时编码长度增加的问题。 相似文献
17.
In this paper, we propose a new metric for rooted trees with unlabeled vertices based on alignments of nested parenthesis strings. We prove that the time complexity for computing this metric is NP-hard and present a 1.5-approximation algorithm for it. 相似文献
18.
POTMiner: mining ordered, unordered, and partially-ordered trees 总被引:1,自引:0,他引:1
Aída Jiménez Fernando Berzal Juan-Carlos Cubero 《Knowledge and Information Systems》2010,23(2):199-224
Non-linear data structures are becoming more and more common in data mining problems. Trees, in particular, are amenable to
efficient mining techniques. In this paper, we introduce a scalable and parallelizable algorithm to mine partially-ordered
trees. Our algorithm, POTMiner, is able to identify both induced and embedded subtrees in such trees. As special cases, it
can also handle both completely ordered and completely unordered trees. 相似文献
19.
20.
H. Prodinger 《Computing》1982,28(4):363-366
R. Kemp has shown that the average height of r-tuply rooted planted plane trees is $$\sqrt {\pi n} - \frac{1}{2}(r - 2) + O(\log (n)n^{1/2 - \varepsilon } ), \varepsilon > 0, n \to \infty ,$$ assuming that all such trees withn nodes are equally likely. We give a quite short proof of this result (with an error term ofO (1)). 相似文献