A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The approach extends to other parametric minimum spanning tree problems on planar graphs and to other families of graphs having small separators. Disciplines Theory and Algorithms This article is available at Iowa State Univer...

Stock price prediction is really popular in finance. A good stock can benefit investors. In this study, the of Amazon was predicted using decision tree and linear regression. Besides study compared accuracy results two algorithms. The models use previous volume as predictor. This finds that Decision Tree algorithm fit a better model than Linear Regression algorithm. It indicates fits Moreover, ...

Numerous machine learning algorithms contain pairwise statistical problems at their core— that is, tasks that require computations over all pairs of input points if implemented naively. Often, tree structures are used to solve these problems efficiently. Dual-tree algorithms can efficiently solve or approximate many of these problems. Using cover trees, rigorous worstcase runtime guarantees hav...

Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. In this paper, we present HybridTreeMiner, a computationally efficient algorithm that discovers all frequently occurring subtrees in a database of rooted unordered trees. The algorithm mines frequent subtrees by traversing an enumeration tree that syst...

In this paper we study the sequence length requirements of distance-based evolutionary tree building algorithms in the Jukes-Cantor model of evolution. By deriving lower bounds on sequence lengths required to recover the evolutionary tree topology correctly , we show that two algorithms, the Short Quartet Method and the Harmonic Greedy Triplets algorithms have optimal sequence length requirements.

We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully scanned. Given the large data volumes created by the ever increasing time dimension, sequential scanning is prohibitive. This is especially true when the temporal join involves only parts of the joining relations (e.g...

One of the research areas in RFID systems is a tag anti-collision protocol; how to reduce identification time with a given number of tags in the field of an RFID reader. There are two types of tag anticollision protocols for RFID systems: tree based algorithms and slotted aloha based algorithms. Many anticollision algorithms have been proposed in recent years, especially in tree based protocols...