Abstract In binary and ordinal regression one can distinguish between a location component scaling component. While the former determines within range of response categories, indicates variance heterogeneity. particular since it has been demonstrated that misleading effects occur if ignores presence component, is important to account for potential in model, which not possible available recursiv...

Many Web documents such as HTML files and XML files have no rigid structure and are called semistructured data. In general, such semistructured Web documents are represented by rooted trees with ordered children. We propose a new method for discovering frequent tree structured patterns in semistructured Web documents by using a tag tree pattern as a hypothesis. A tag tree pattern is an edge lab...

Since tree-structured data such as XML files are widely used for data representation and exchange on the Internet, discovering frequent tree patterns over tree-structured data streams becomes an interesting issue. In this paper, we propose an online algorithm to continuously discover the current set of frequent tree patterns from the data stream. A novel and efficient technique is introduced to...

Tree-structured data are abundant today, ranging from Bioinformatics suffix-tree alignments, to multi-resolution video, to directory-file hierarchies, to XML. The storage techniques employed by systems that manage tree-structured data greatly affect their performance. Current approaches either map the tree data to an underlying relational database system, or use the abstraction provided by a ge...

Structured prediction tasks pose a fundamental trade-off between the need for model complexity to increase predictive power and the limited computational resources for inference in the exponentially-sized output spaces such models require. We formulate and develop the Structured Prediction Cascade architecture: a sequence of increasingly complex models that progressively filter the space of pos...

We present a structure for transition systems with which the main decidability results on Petri nets can be generalized to structured transition systems. We define the reduced reachability tree of a structured transition system; it allows one to decide the finite reachability tree problem (also called the finite termination problem) and the finite reachability set problem. A general definition ...

The full-search vector quantization suffers from spending much time searching the whole codebook sequentially. Rcccntly, several tree-structured vector quantizers had been proposed. But almost all trees used arc binary trees and hence the training samples contained in each node are forced to be divided into two clusters artificially. We present a general-tree-structured vector quantizer that is...

An algorithm recently introduced by Breiman, Friedman, Olshen, and Stone in the context of classification and regression trees is reinterpreted and extended to cover a variety of applications in source coding and modeling in which trees are involved. These include variable-rate and minimum-entropy tree-structured vector quantization, minimum expected cost decision trees, variable-order Markov m...

Binary tree-structured filter banks have been employed in the past to generate wavelet bases. While the relation between paraunitary filter banks and orthonormal bases is known to some extent, there are some extensions which are either not known, or not published so far. In particular it is known that a binary tree-structured filter bank with the same paraunitary polyphase matrix on all levels ...

We present a novel, yet simple, technique for the speciication of context in structured documents that we call caterpillar expressions. Although we are primarily applying this technique in the speciication of context-dependent style sheets for HTML, SGML and XML documents, it can also be used for query speciica-tion for structured documents, as we shall demonstrate, and for the speciication of ...