Clustering with Random Indexing K-tree and XML Structure

被引：0
|
作者：
De Vries, Christopher M. [1 ]
Geva, Shlomo [1 ]
De Vine, Lance [1 ]
机构：
[1] Queensland Univ Technol, Fac Sci & Technol, Brisbane, Qld 4001, Australia
来源：
FOCUSED RETRIEVAL AND EVALUATION | 2010年 / 6203卷
关键词：
INEX; XML; Mining; Documents; Clustering; Structure; K-tree; Random Indexing; Random Projection; LINDENSTRAUSS; JOHNSON;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper describes the approach taken to the clustering task at INEX 2009 by a group at the Queensland University of Technology The Random Indexing (RI) K-tree has been used with a representation that is based on the semantic markup available in the INEX 2009 Wikipedia collection The RI K-tree is a scalable approach to clustering large document collections This approach has produced quality clustering when evaluated using two different methodologies
引用
收藏
页码：407 / 415
页数：9
相关论文
共 50 条
  • [31] A tree-based approach to clustering XML documents by structure
    Costa, G
    Manco, G
    Ortale, R
    Tagarelli, A
    KNOWLEDGE DISCOVERY IN DATABASES: PKDD 2004, PROCEEDINGS, 2004, 3202 : 137 - 148
  • [32] Independence polynomials of k-tree related graphs
    Song, Lanzhen
    Staton, William
    Wei, Bing
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (08) : 943 - 950
  • [33] Independence polynomials of k-tree related graphs
    Department of Mathematics, University of Mississippi, University, MS 38677, United States
    Discrete Appl Math, 8 (943-950):
  • [34] Heuristics for Minimum Spanning k-tree Problem
    Shangin, Roman E.
    Pardalos, Panos M.
    2ND INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND QUANTITATIVE MANAGEMENT, ITQM 2014, 2014, 31 : 1074 - 1083
  • [35] Research on XML Normalization Struct Indexing Tree
    Li, Xu
    Wu, Di
    Zhang, Bangzuo
    2010 INTERNATIONAL COLLOQUIUM ON COMPUTING, COMMUNICATION, CONTROL, AND MANAGEMENT (CCCM2010), VOL IV, 2010, : 651 - 654
  • [36] A Sufficient Condition for a Graph to Have a k-tree
    Aung Kyaw
    Graphs and Combinatorics, 2001, 17 : 113 - 121
  • [37] On extremal sizes of locally k-tree graphs
    Borowiecki, Mieczyslaw
    Borowiecki, Piotr
    Sidorowicz, Elzbieta
    Skupien, Zdzislaw
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 2010, 60 (02) : 571 - 587
  • [38] Constructing of XML indexing tree based on normalization
    Yang, Xiquan
    Zhang, Bo
    Chen, Xuefeng
    ADVANCING SCIENCE THROUGH COMPUTATION, 2008, : 32 - 35
  • [39] A sufficient condition for a graph to have a k-tree
    Kyaw, A
    GRAPHS AND COMBINATORICS, 2001, 17 (01) : 113 - 121
  • [40] K-TREE CONTAINER DATA-STRUCTURES
    BATES, R
    DR DOBBS JOURNAL, 1994, 19 (10): : 26 - &
12345