Query Rewriting and Semantic Annotation in Semantic-Based Image Retrieval under Heterogeneous Ontologies of Big Data

被引:4
作者
Jia, Baoxian [1 ]
Meng, Bin [1 ]
Zhang, Wunong [2 ]
Liu, Jia [1 ]
机构
[1] Liaocheng Univ, Liaocheng 252059, Shandong, Peoples R China
[2] Henan Univ, Kaifeng 475001, Henan, Peoples R China
关键词
semantic web; ontology mapping; query rewriting; big data; semantic annotation; HARMONY SEARCH ALGORITHM; SHOP SCHEDULING PROBLEM; BEE COLONY ALGORITHM;
D O I
10.18280/ts.370113
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In the era of big data, it is of great significance to retrieve the semantic features from images by big data technique. However, most semantic query models perform poorly in actual images, which are distributed heterogeneously. Image ontology mapping provides a solution to the problem. This paper applies the H-Match algorithm to find the mapping relationship between image ontologies in peer-to-peer (P2P) environment, and rewrite user queries for heterogeneous image ontologies. The H-Match algorithm was developed under the framework called Helios evolving interaction-based ontology knowledge sharing (Helios). The weights of semantic annotation were calculated by a novel method, involving word frequency, position and feedback. The research results have great application potentials in various fields.
引用
收藏
页码:101 / 105
页数:5
相关论文
共 20 条
[1]  
Bouquet P., 2004, MEAN COORD NEG WORKS
[2]   HELIOS: a general framework for ontology-based knowledge sharing and evolution in P2P systems [J].
Castano, S ;
Ferrara, A ;
Montanelli, S ;
Zucchelli, D .
14TH INTERNATIONAL WORKSHOP ON DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS, 2003, :597-603
[3]  
Castano S, 2003, P 1 INT C SEM WEB DA, P218
[4]  
Doan A., 2002, P 11 INT C WORLD WID, P662, DOI [10.1145/511446.511532, DOI 10.1145/511446.511532]
[5]  
Gang Zhou, 2011, Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. 7th International Conference, ICIC 2011. Revised Selected Papers, P1, DOI 10.1007/978-3-642-25944-9_1
[6]   Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives [J].
Gao, K. Z. ;
Suganthan, P. N. ;
Pan, Q. K. ;
Chua, T. J. ;
Cai, T. X. ;
Chong, C. S. .
JOURNAL OF INTELLIGENT MANUFACTURING, 2016, 27 (02) :363-374
[7]   Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling [J].
Gao, K. Z. ;
Suganthan, P. N. ;
Pan, Q. K. ;
Chua, T. J. ;
Cai, T. X. ;
Chong, C. S. .
INFORMATION SCIENCES, 2014, 289 :76-90
[8]   A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion [J].
Gao, Kai Zhou ;
Suganthan, Ponnuthurai Nagaratnam ;
Chua, Tay Jin ;
Chong, Chin Soon ;
Cai, Tian Xiang ;
Pan, Qan Ke .
EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (21) :7652-7663
[9]   An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time [J].
Gao, Kai Zhou ;
Suganthan, Ponnuthurai Nagaratnam ;
Pan, Quan Ke ;
Tasgetiren, Mehmet Fatih .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2015, 53 (19) :5896-5911
[10]   A Review on Swarm Intelligence and Evolutionary Algorithms for Solving Flexible Job Shop Scheduling Problems [J].
Gao, Kaizhou ;
Cao, Zhiguang ;
Zhang, Le ;
Chen, Zhenghua ;
Han, Yuyan ;
Pan, Quanke .
IEEE-CAA JOURNAL OF AUTOMATICA SINICA, 2019, 6 (04) :904-916