Indexing Multiple-Instance Objects

被引:0
|
作者
Zhou, Linfei [1 ]
Ye, Wei [1 ]
Wang, Zhen [2 ]
Plant, Claudia [3 ]
Boehm, Christian [1 ]
机构
[1] Ludwig Maximilians Univ Munchen, Munich, Germany
[2] Univ Elect Sci & Technol China, Chengdu, Sichuan, Peoples R China
[3] Univ Vienna, Vienna, Austria
关键词
DISTANCE;
D O I
10.1007/978-3-319-64471-4_13
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
As an actively investigated topic in machine learning, Multiple-Instance Learning (MIL) has many proposed solutions, including supervised and unsupervised methods. We introduce an indexing technique supporting efficient queries on Multiple-Instance (MI) objects. Our technique has a dynamic structure that supports efficient insertions and deletions and is based on an effective similarity measure for MI objects. Some MIL approaches have proposed their similarity measures for MI objects, but they either do not use all information or are time consuming. In this paper, we use two joint Gaussian based measures for MIL, Joint Gaussian Similarity (JGS) and Joint Gaussian Distance (JGD). They are based on intuitive definitions and take all the information into account while being robust to noise. For JGS, we propose the Instance based Index for querying MI objects. For JGD, metric trees can be directly used as the index because of its metric properties. Extensive experimental evaluations on various synthetic and real-world data sets demonstrate the effectiveness and efficiency of the similarity measures and the performance of the corresponding index structures.
引用
收藏
页码:143 / 157
页数:15
相关论文
共 50 条
  • [31] Optimizing Bag Features for Multiple-Instance Retrieval
    Fu, Zhouyu
    Pan, Feifei
    Deng, Cheng
    Liu, Wei
    [J]. PROCEEDINGS OF THE TWENTY-NINTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2015, : 2596 - 2602
  • [32] MIForests: Multiple-Instance Learning with Randomized Trees
    Leistner, Christian
    Saffari, Amir
    Bischof, Horst
    [J]. COMPUTER VISION - ECCV 2010, PT VI, 2010, 6316 : 29 - 42
  • [33] Multiple-Instance Learning with Instance Selection via Constructive Covering Algorithm
    Zhang, Yanping
    Zhang, Heng
    Wei, Huazhen
    Tang, Jie
    Zhao, Shu
    [J]. TSINGHUA SCIENCE AND TECHNOLOGY, 2014, 19 (03) : 285 - 292
  • [34] Fast Bundle Algorithm for Multiple-Instance Learning
    Bergeron, Charles
    Moore, Gregory
    Zaretzki, Jed
    Breneman, Curt M.
    Bennett, Kristin P.
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2012, 34 (06) : 1068 - 1079
  • [35] An approach for multiple-instance based service composition
    Graja, Imen
    Guermouche, Nawal
    Kacem, Ahmed Hadj
    Drira, Khalil
    [J]. 2015 IEEE 12TH INTERNATIONAL CONFERENCE ON SERVICES COMPUTING (SCC 2015), 2015, : 435 - 442
  • [36] Maximum margin multiple-instance feature weighting
    Chai, Jing
    Chen, Hongtao
    Huang, Lixia
    Shang, Fanhua
    [J]. PATTERN RECOGNITION, 2014, 47 (06) : 2091 - 2103
  • [37] Multiple-Instance Learning with Instance Selection via Constructive Covering Algorithm
    Yanping Zhang
    Heng Zhang
    Huazhen Wei
    Jie Tang
    Shu Zhao
    [J]. Tsinghua Science and Technology, 2014, (03) : 285 - 292
  • [38] ENSEMBLE-BASED INSTANCE RELEVANCE ESTIMATION IN MULTIPLE-INSTANCE LEARNING
    Waqas, Muhammd
    Tahir, Muhammad Atif
    Qureshi, Rizwan
    [J]. PROCEEDINGS OF THE 2021 9TH EUROPEAN WORKSHOP ON VISUAL INFORMATION PROCESSING (EUVIP), 2021,
  • [39] Learning Instance Concepts from Multiple-Instance Data with Bags as Distributions
    Doran, Gary
    Ray, Soumya
    [J]. PROCEEDINGS OF THE TWENTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2014, : 1802 - 1808
  • [40] Multiple-Instance Learning with Instance Selection via Constructive Covering Algorithm
    Yanping Zhang
    Heng Zhang
    Huazhen Wei
    Jie Tang
    Shu Zhao
    [J]. Tsinghua Science and Technology., 2014, 19 (03) - 292