✦ LIBER ✦

A Chinese Web page clustering algorithm based on the suffix tree

✍ Scribed by Yang Jian-wu

Publisher: Wuhan University
Year: 2004
Tongue: English
Weight: 809 KB
Volume: 9
Category: Article
ISSN: 1007-1202
DOI: 10.1007/bf02831687

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

CHSMST: a clustering algorithm based on

CHSMST: a clustering algorithm based on hyper surface and minimum spanning tree

✍ Qing He; Weizhong Zhao; Zhongzhi Shi 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 333 KB

A new fuzzy relational clustering algori

A new fuzzy relational clustering algorithm based on the fuzzy C-means algorithm

✍ P. Corsini; B. Lazzerini; F. Marcelloni 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 702 KB

A clustering procedure based on the comp

A clustering procedure based on the comparison between the k nearest neighbors graph and the minimal spanning tree

✍ José Marı́a González-Barrios; Adolfo J. Quiroz 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 250 KB

We present a procedure for the identiÿcation of clusters in multivariate data sets, based on the comparison between the k nearest neighbors graph, G k , and the minimal spanning tree, MST. Our key statistic is the random quantity k := the smallest k such that G k contains the MST. Under regularity a

A branch and bound algorithm for the sym

A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation

✍ Ton Volgenant; Roy Jonker 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 538 KB

A robust algorithm for moving interface

A robust algorithm for moving interface of multi-material fluids based on Riemann solutions

✍ Xueying Zhang; Ning Zhao 📂 Article 📅 2006 🏛 The Chinese Society of Theoretical and Applied Mec 🌐 English ⚖ 321 KB