Probability database classification matching model based on the semantic WEB service

被引：0
作者：
机构：
[1] College of Information Science and Technology, Jiujiang University
来源：
Yuan, Y. (yuanyuanliuwencai@gmail.com) | 1600年 / Binary Information Press, P.O. Box 162, Bethel, CT 06801-0162, United States卷 / 09期
关键词：
Data classification; Probabilistic information search; Probability database; Semantic web service;
D O I：
10.12733/jcis6412
中图分类号：
学科分类号：
摘要：
The data in traditional relation database is accurate, however, modern applications need to use a lot of data which are inaccurate and has a certain credibility probability. The existing query mechanisms on the probability data have not take into account the user personalization factors, which causes the too many number of return tuple. Many of small probability data do not accord with the potential requirement of users. Based on the application requirements, in order to return the most probability data to user, this paper provides a classification matching model of probability database based on the semantic web service. This model classify the probability data according to user individual character data, find the most needed probability data by user from the probability database based on the semantic web service, and return the results which have high grading number (relational degree) between users and data preferentially, the model effectively improve the hit rate of query on the probability database. The experimental results show that the method proposed in this paper is feasible and effective in a certain data range. © 2013 by Binary Information Press.
引用
收藏
页码：4973 / 4980
页数：7
相关论文
共 10 条
  • [1] Feng D., Kwock L., Yueh L., Taylor R., Matching visual saliency to confidence in plots of uncertain data, Visualization and Computer Graphics, 16, 6, pp. 980-989, (2010)
  • [2] Aling Q., Xiaofeng D., Yansheng L., Probabilistic similarity search in uncertain time-series database, International Conference on Information Engineering and Computer Science, pp. 1-4, (2009)
  • [3] Matthias R., University L.M., Mnchen M., Similarity search in uncertain databases: Challenges, techniques and new trends, Proceedings of the 1st Workshop on New Trends in Similarity Search, pp. 120-126, (2011)
  • [4] Lian X., Chen L., Efficient query answering in probabilistic RDF graphs, Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data, pp. 157-168, (2011)
  • [5] Xu J., Zhang Z., Tung A.K., Yu G., Efficient and effective similarity search over probabilistic data based on Earth Mover's Distance, The VLDB Journal - The International Journal on Very Large Data Bases, 21, 4, pp. 535-559, (2012)
  • [6] Miotto R., Orio N., A probabilistic model to combine tags and acoustic similarity for music retrieval, ACM Transactions on Information Systems, 30, 2, pp. 156-172, (2012)
  • [7] Qian H., Shen S., SWSQT(semantic web service query tree): Quick discovery and organization mechanism for Web Service, Journal of Computational Information Systems, 7, 11, pp. 4015-4022, (2011)
  • [8] Augusto D.A., Barbosa H.J.C., Ebecken N.F.F., Coevolutionary multi-population genetic programming for data classification, Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, pp. 933-940, (2010)
  • [9] Bhuvaneswari A., Karpagam G.R., Applying fluent calculus for automated and dynamic semantic web service composition, Proceedings of the 1st International Conference on Intelligent Semantic Web-Service and Applications, pp. 162-175, (2010)
  • [10] Abed M.A.M., Automatic selection and invocation of a WSMO: Based semantic web service, Proceedings of the 2011 International Conference on Intelligent Semantic Web-Service and Applications, pp. 192-201, (2011)
1