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 条
  • [21] Connected even factors in k-tree
    Li, Yinkui
    Qin, Xiaoxiao
    Li, Wen
    Wang, Xiaoling
    Ma, Haicheng
    OPEN MATHEMATICS, 2020, 18 : 1601 - 1605
  • [22] Spanning k-tree with specified vertices
    Song, Feifei
    Zhou, Jianjie
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2019, 11 (04)
  • [23] A k-Tree Containing Specified Vertices
    Chiba, Shuya
    Matsubara, Ryota
    Ozeki, Kenta
    Tsugaki, Masao
    GRAPHS AND COMBINATORICS, 2010, 26 (02) : 187 - 205
  • [24] Stochastic k-Tree Grammar and Its Application in Biomolecular Structure Modeling
    Ding, Liang
    Samad, Abdul
    Xue, Xingran
    Huang, Xiuzhen
    Malmberg, Russell L.
    Cai, Liming
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2014), 2014, 8370 : 308 - 322
  • [25] K-tree: A height balanced tree structured vector quantizer
    Geva, Shlomo, 2000, IEEE, Piscataway, NJ, United States (01):
  • [26] K-tree:: A height balanced tree structured vector quantizer
    Geva, S
    NEURAL NETWORKS FOR SIGNAL PROCESSING X, VOLS 1 AND 2, PROCEEDINGS, 2000, : 271 - 280
  • [27] On a k-Tree Containing Specified Leaves in a Graph
    Haruhide Matsuda
    Hajime Matsumura
    Graphs and Combinatorics, 2006, 22 : 371 - 381
  • [28] On a k-tree containing specified leaves in a graph
    Matsuda, Haruhide
    Matsumura, Hajime
    GRAPHS AND COMBINATORICS, 2006, 22 (03) : 371 - 381
  • [29] On extremal sizes of locally k-tree graphs
    Mieczysław Borowiecki
    Piotr Borowiecki
    Elżbieta Sidorowicz
    Zdzisław Skupień
    Czechoslovak Mathematical Journal, 2010, 60 : 571 - 587
  • [30] Ancestors and Descendants in Evolving k-Tree Models
    Panholzer, Alois
    Seitz, Georg
    RANDOM STRUCTURES & ALGORITHMS, 2014, 44 (04) : 465 - 489
12345