-
1“... structure helps in identifying sequences with similar functionality. Many algorithms have been proposed...”
Get full text
Others -
2“..., previous algorithms to mine closed frequent itemsets in the traditional database are not suitable for data...”
Get full text
Others -
3“... are correct as compared to the other models. The structure of the INSTANT algorithm is simple and it can save...”
Get full text
Others -
4“... on the sliding window model is called the MFIoSSW algorithm. The MFIoSSW algorithm uses a compact structure...”
Get full text
Others -
5“... can only scan once for the data streams. Therefore, the previous algorithms in the traditional...”
Get full text
Others -
6“... the overestimated utilities method and constructs their MIQ-Tree data structure. However, the MIQ-Tree has...”
Get full text
Others -
7“... data structure of the kNN answers. Next, we propose the Intersection of Perpendicular Bisectors...”
Get full text
Others -
8“.... They often issue the K Nearest Neighbor (KNN) query to obtain data objects reachable through the road network...”
Get full text
Others -
9“...碩士 === 國立中山大學 === 資訊工程學系研究所 === 97 === Proteins are the structural components of living cells...”
Get full text
Others -
10“... strategies. We design three methods by using the idea of the Apriori algorithm which is one of well-known...”
Get full text
Others -
11“...-tree browsing algorithm SI-b and an index merging algorithm SI-m. However, in their data structure, a...”
Get full text
Others -
12“... the inverted-list approach, there are other data structures, such as the suffix tree, the suffix array...”
Get full text
Others -
13“...-based sliding window, Chang et al. proposed an algorithm called SeqStream. It uses a data struc- ture...”
Get full text
Others -
14“..., and constructs the IWEI-Tree and OP-List data structures for the dynamic database. However, the IWEI-Tree has...”
Get full text
Others -
15“...碩士 === 國立中山大學 === 資訊工程學系研究所 === 91 === ABSTRACT Broadcasting data delivery is rapidly becoming...”
Get full text
Others -
16“... shown to be one of the most efficient data structures for mining large itemsets, to find the large...”
Get full text
Others -
17“... to decrease the processing time for constructing the data structure, in this thesis, we propose two data...”
Get full text
Others -
18“... advances in technologies, algorithms for efficiently answering queries about large number of spatial data...”
Get full text
Others -
19“... of data points is increased, the execution time of our algorithm is increased slowly. Moreover, our...”
Get full text
Others -
20“... of data points is increased, the execution time of our algorithm is increased slowly. Moreover, our...”
Get full text
Others