Voronoi Diagram Based Retrieval Method for the Internet of Things

Abstract:

In the Internet of Things, search service is that information which is corresponding to entities in real world is retrieve so as to help people achieve information that they need. From the angle of visualization, this paper study the search service in the Internet of Things. With the Vector-Space Model, entities' information is expressed as entity vectors, and a Voronoi diagram based Vector-Space Model visualization method is presented. According to similarity between entity vectors, entity vectors' position in two-dimensional plane is calculated and this plane is divided into Voronoi diagram by nodes as which feature vectors of entity vectors’ clustering are taken. According to similarity between query vector and feature vector, a Voronoi diagram based Vector-Space Model retrieval method is put forward. This method restricts the searching scope in Voronoi domain of feature vectors that are the most similar to query vector, thereby the number of compared entity vectors is reduced in the retrieval process. The experiment result indicates that this method can ensure retrieval precision and improve retrieval efficiency.

• Periodical: Advanced Materials Research (Volumes 472-475)
• Pages: 3420-3424
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.472-475.3420
• Online since: February 2012
• Authors: Wen Bin Zhao, Zheng Xu Zhao
• Keywords: Internet of Things (IOT), Retrieval Method, Search Service, Vector-Space Model, Visualization, Voronoi Diagram

References

[1] ITU. ITU Internet report 2005: the Internet of Things. Geneva: ITU, 2005.

[2] ROMER K, OSTERMAIER B, MATI'ERN F, et al. Real-time search for real-world entities: a survey. Proceedings of the IEEE, 2010, 98(11): 1887-1902.

DOI: 10.1109/jproc.2010.2062470

[3] BRIN S, PAGE L. The anatomy of a large-scale hyper textual Web search engine. Proc of the 7th International World Wide Web Conference. [S.I.]: Elsevier Science Publisher B.V., 1998: 107-117.

[4] DING C H, BUYYA R. Guided Google: a meta search engine and its implementation using the Google distributed Web services. International Journal of Computer and Application, 2004, 26(3): 1454-1465．

DOI: 10.2316/journal.202.2004.3.202-1465

[5] INMON B. Structured and unstructured data. http://www.b-eye-network.com/view/4955. 2010-10-12.

[6] TAN C C, SHENG Bo, WANG Hao-dong, et al. Microsearch-when search engines meet small devices. Proc of the 6th International Conference on Pervasive Computing[S. I.]: Springer, 2008: 93-110.

DOI: 10.1007/978-3-540-79576-6_6

[7] WANG Hao-dong, TAN C C, LI Qun. Snoogle: a search engine for pervasive environments. IEEE Trans on Parallel and Distributed Systems, 2010, 21(8): 1188-1202.

DOI: 10.1109/tpds.2009.145

[8] NIST. NIST's dictionary of algorithms and data structures: inverted index. http://xw2k.nist.gov/ dads//HTML/invertedIndex.html. 2010-10-23.

[9] ILYAS I, BESKALES G, SOLIMAN M. A survey of Top-k query processing techniques in relational database systems. ACM Computing Surveys, 2008, 40(4): 1131-1158.

DOI: 10.1145/1391729.1391730

[10] Andre Skupin, Discrete and continuous conceptualizations of science: Implications for knowledge domain visualization, Journal of Informatics. vol. 3, no. 3, , 2009 pp.233-245.

DOI: 10.1016/j.joi.2009.03.002

[11] Kennedy J, Eberhart R. Particle swarm optimization. Proceedings of IEEE International Conference on Neural Networks. Washington DC: IEEE Computer Society Press, pp.1942-1948, 1995.

[12] Ioana Stanoi, Mirek Riedewald, Divyakant Agrawal, Amr E Abbadi, Discovery of influence sets in frequently updated databases. In Proc. Int. Conf. on Very Large Databases (VLDB), , 2001 pp.99-108.