suffix tree clustering
基本解釋
- [計算機科學(xué)技術(shù)]后綴樹聚類
英漢例句
- Therefore, this article applies suffix tree algorithm to the meta search engines, and designs a meta search engine systems with a clustering algorithm.
因此,本文將后綴樹算法應(yīng)用到元搜索引擎中,設(shè)計了一個帶聚類的元搜索引擎系統(tǒng)。 - To improve the clustering efficiency, a simple but reasonable measure for base cluster selection is presented to exclude some generalized suffix tree nodes which contribute less to the clustering.
為了進一步提高聚類效率,給出了一種簡單有效的用于基類選擇的測度,用來排除一些無意義的廣義后綴樹節(jié)點。
雙語例句
專業(yè)釋義
- 后綴樹聚類
On the basis of experiment results,K-means,Suffix Tree Clustering and improved Suffix Tree Clustering are compared in terms of accuracy and time-complexity.
對典型的k-平均算法、后綴樹聚類算法和改進后的算法進行實驗分析,在算法準確率和時間復(fù)雜度上進行了比較。