Proceedings of 2013 International Conference on Information Science and Computer Applications

WordNet-Based Suffix Tree Clustering Algorithm

Authors
Qiuyue Dang, Jiwei Zhang, Yueming Lu, Kuo Zhang
Corresponding Author
Qiuyue Dang
Available Online October 2013.
DOI
https://doi.org/10.2991/isca-13.2013.12How to use a DOI?
Keywords
search results clustering, suffix tree, STC, WordNet synsets
Abstract
High space cost and ignoring synonyms in STC (Suffix Tree Clustering algorithm) are challenges for search results clustering. Aiming at these challenges, this paper proposes a WordNet-based suffix tree clustering algorithm (WNSTC). WNSTC can construct a suffix tree containing WordNet synsets. When constructing the suffix tree, WNSTC looks every feature word up in WordNet database. If the feature word is included in WordNet, its synsets will be added into corresponding node. The node in the suffix tree may be a set of words (strings) with similar meaning instead of a single word (string). Experiments executed on data sets show that WNSTC has better clustering quality and smaller suffix tree size than original STC algorithm.
Open Access
This is an open access article distributed under the CC BY-NC license.

Download article (PDF)

Proceedings
2013 International Conference on Information Science and Computer Applications (ISCA 2013)
Part of series
Advances in Intelligent Systems Research
Publication Date
October 2013
ISBN
978-90786-77-85-7
ISSN
1951-6851
DOI
https://doi.org/10.2991/isca-13.2013.12How to use a DOI?
Open Access
This is an open access article distributed under the CC BY-NC license.

Cite this article

TY  - CONF
AU  - Qiuyue Dang
AU  - Jiwei Zhang
AU  - Yueming Lu
AU  - Kuo Zhang
PY  - 2013/10
DA  - 2013/10
TI  - WordNet-Based Suffix Tree Clustering Algorithm
BT  - 2013 International Conference on Information Science and Computer Applications (ISCA 2013)
PB  - Atlantis Press
SN  - 1951-6851
UR  - https://doi.org/10.2991/isca-13.2013.12
DO  - https://doi.org/10.2991/isca-13.2013.12
ID  - Dang2013/10
ER  -