Volume-4 , Issue-4 , Apr - 2016 Go Back

Conventional spatial queries, such as range seek and nearest neighbor retrieval, include only conditions on objects’ geometric properties. The proposed framework uses an productive calculation to find the accurate nearest neighbor based on the Euclidean separation for large-scale PC vision problems. We insert data focuses nonlinearly onto a low-dimensional space by straightforward calculations and demonstrate that the separation between two focuses in the implanted space is limited by the separation in the unique space. Instead of registering the separations in the high-dimensional unique space to find the nearest neighbor, a parcel of applicants are to be rejected based on the separations in the low-dimensional implanted space; due to this property, our calculation is appropriate for high-dimensional and large-scale problems. We too appear that our calculation is improved further by apportioning info vectors recursively. Opposite to most of existing quick nearest neighbor seek algorithms, our method reports the accurate nearest neighbor not an rough one and requires a exceptionally straightforward preparing with no modern data structures. We give the hypothetical examination of our calculation and assess its execution in manufactured and genuine data.

Keyword Search, Nearest Neighbor Search, Spatial Index

[1] J. Broder. Strategies for efficient incremental nearest neighbor search. In Pattern Recognition, 23(1–2):171–178, January 1990.
[2] Nicolas Bruno, Luis Gravano, Amélie Marian. Evaluating Top-k Queries over Web-Accessible Databases., ICDE 2002. [CG99] S. Chaudhuri and L. Gravano. Evaluating top-k selection queries. In VLDB, 1999.
[3] W. W. Chang, Hans-Jörg Schek: A Signature Access Method for the Starburst Database System. VLDB 1989: 145-153
[4] Yen-Yu Chen, Torsten Suel, Alexander Markowetz. Efficient Query Processing in Geographic Web Search Engines. SIGMOD 2006
[5] U. Deppisch. S-Tree: A dynamic balanced signature index for office retrieval. In Proc. of the ACM Conf. on Research and Development in Information Retrieval, Pisa, 1986.
[6] Ron Sacks-Davis, Kotagiri Ramamohanarao: A two level superimposed coding scheme for partial match retrieval. Inf. Syst. 8(4): 273-289 (1983)
[7] Ronald Fagin, Amnon Lotem, Moni Naor: Optimal Aggregation Algorithms for Middleware. In PODS 2001
[8] Christos Faloutsos: Signature files: Design and Performance Comparison of Some Signature Extraction Methods. In SIGMOD Conference 1985
[9] Christos Faloutsos, Stavros Christodoulakis: Signature Files: An Access Method for Documents and Its Analytical Performance Evaluation. In ACM Trans. Inf. Syst. 2(4): 267-288(1984)
[10] Christos Faloutsos, Stavros Christodoulakis: Design of a Signature File Method that Accounts for Non-Uniform Occurrence and Query Frequencies. In VLDB 1985: 165-170
[11] Faloutsos, D. W. Oard. A survey of information retrieval and filtering methods. Technical Report. UMI Order Number: CSTR-3514., University of Maryland at College Park, 1995
[12] Guttman. R-Trees: a dynamic index structure fo

V.Maniraj, R.Mary, "Productive K-Nearest Neighbor (PKNN) and Index Based Positioning for Keyword Search," International Journal of Computer Sciences and Engineering, Vol.4, Issue.4, pp.379-383, 2016.

Web mining has been explored to a vast degree and diverse systems have been proposed for a assortment of applications that join Web Search, Web Classification, Web Personalization, Versatile Web Locales etc. Mining Web structure Data has resulted in assortment of hyper join based algorithms to rank results of a query. Similarly, Web use Data has been utilized to distinguish user-sessions and group them for better forecast of client route patterns. Most relook on Web mining has so far been from a “data-centric” point of view. In this venture we examine the temporal measurement of the Web use data. We study in specific the conduct of Web use Data over a period of time and group pages that follow comparable access patterns. Such kind of examination could be valuable for target marketing based on time or for web services optimization. In the second part of the project, we characterize a new measure called “Page Popularity” that counts the number of hits to Web pages amid a certain time period and giving more weight to the pages that have been accessed frequently amid a “recent” period of time. This kind of examination helps in distinguishing emerging “popular” themes and brings down the bias on any subject that is “obsolete” yet has been accessed a part amid an prior period of time.

Web mining, Web Content, Web Structure, Web Services, Web Clustering

[1] Sangeetha, M.; Dept. of Comput. Sci., Pondicherry Univ., Pondicherry, India; Joseph, K.S. "Page ranking algorithms used in Web Mining" Published in: Information Communication and Embedded Systems (ICICES), 2014 International Conference on Date of Conference: 27-28 Feb. 2014 Page(s): 1 - 7
[2] Singh, B.; Dept. of Comput. Sci., Univ. of Lucknow, Lucknow, India; Singh, H.K. "Web Data Mining research: A survey" Published in: Computational Intelligence and Computing Research (ICCIC), 2010 IEEE International Conference on Date of Conference: 28-29 Dec. 2010 Page(s): 1 - 10
[3] Manjusha, R.; Dept. of Inf. Technol., Sathyabama Univ., Chennai, India; Ramachandran, R. "Web mining framework for security in e-commerce" Published in: Recent Trends in Information Technology (ICRTIT), 2011 International Conference on Date of Conference: 3-5 June 2011 Page(s): 1043 - 1048
[4] Azad, H.K.; Dept. of CSE, NIT Patna, Patna, India; Abhishek, K. "Semantic-Synaptic Web Mining: A Novel Model for Improving the Web Mining" Published in: Communication Systems and Network Technologies (CSNT), 2014 Fourth International Conference on Date of Conference: 7-9 April 2014 Page(s): 454 - 457
[5] Malviya, B.K.; Dept. of Sch. of Inf. Technol., Rajiv Gandhi Proudyogiki Vishwavidyalaya, Bhopal, India; Agrawal, J. "A Study on Web Usage Mining Theory and Applications" Published in:Communication Systems and Network Technologies (CSNT), 2015 Fifth International Conference on Date of Conference: 4-6 April 2015 Page(s): 935 - 939
[6] Li Qingshan; Software Eng. Inst., Xidian Univ., Xi''an, China "Study of a content oriented web architectural model" Published in: Computer Networks and Mobile Computing, 2001. Proceedings. 2001 International Conference on Date of Conference: 2001 Page(s): 3 - 7
[7] Flotynski, J.; Poznan Univ. of Econ., Poznan, Poland "Harvesting of semantic metadata from distributed 3D web content " Published in: Human System Interaction (HSI), 2013 The 6th International Conference on Date of Conference: 6-8 June 2013 Page(s): 193 - 200
[8] Lee, R.S.T.; Founder & President of IATOPIA Res. Centre, IATOPIA.com Ltd., Hong Kong, China; Liu, J.N.K.; Yeung, K.S.Y.; Sin, A.H.L. more authors "Agent-Based Web Content Engagement Time (WCET) Analyzer on e-Publication System" Published in: Intelligent Systems Design and Applications, 2009. ISDA '09. Ninth International Conference on Date of Conference: Nov. 30 2009-Dec. 2 2009 Page(s): 67 - 72
[9] Dhivya, G.; Inf. Technol., Panimalar Eng. Coll., Chennai, India; Deepika, K.; Kavitha, J.; Kumari, V.N. "Enriched content mining for web applications" Published in: Innovations in Information, Embedded and Communication Systems (ICIIECS), 2015 International Conference on Date of Conference: 19-20 March 2015 Page(s): 1 - 5
[10] Timmins, P.J.; Dept. of Comput. Sci., Worcester Polytech. Inst., MA; McCormick, S.; Agu, E.; Wills, C.E. "Characteristics of Mobile Web Content" Published in: Hot Topics in Web Systems and Technologies, 2006. HOTWEB '06. 1st IEEE Workshop on Date of Conference: 13-14 Nov. 2006 Page(s): 1 - 10
[11] Boddu, S.B.; Dept. of Master of Comput. Applic., KLEF Univ., Guntur, India; Anne, V.P.K.; Kurra, R.R.; Mishra, D.K. "Knowledge Discovery and Retrieval on World Wide Web Using Web Structure Mining" Published in: Mathematical/Analytical Modelling and Computer Simulation (AMS), 2010 Fourth Asia International Conference on Date of Conference: 26-28 May 2010 Page(s): 532 - 537
[12] Niu, Y.; Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada; Tong Zheng; Jiyang Chen; Goebel, R. "WebKIV: visualizing structure and navigation for Web mining applications" Published in: Web Intelligence, 2003. WI 2003. Proceedings. IEEE/WIC International Conference on Date of Conference: 13-17 Oct. 2003 Page(s): 207 - 213
[13] Zenggui Ou; Heilongjiang Univ., Harbin, China "Data structuring and effective retrieval in the mining of web sequential characteristic" Published in: Electronic and Mechanical Engineering and Information Technology (EMEIT), 2011 International Conference on (Volume:7 ) Date of Conference: 12-14 Aug. 2011 Page(s): 3551 - 3554
[14] da Costa, M.G., Jr.; Dept. of Comput. & Inf. Sci., Univ. of Macau, Taipa, China; Zhiguo Gong "Web structure mining: an introduction" Published in: Information Acquisition, 2005 IEEE International Conference on Date of Conference: 27 June-3 July 2005
[15] Singh, M.P.; North Carolina State Univ., Raleigh, NC, USA "Deep Web structure" Published in: Internet Computing, IEEE (Volume:6 , Issue: 5 ) Date of Publication : Sep/Oct 2002 Page(s): 4 - 5
[16] Benharref, A.; Eng. & Comput. Sci., Abu Dhabi Univ., Abu Dhabi, United Arab Emirates; Serhani, M.A.; Bouktif, S.; Bentahar, J. "A managerial community of Web Services for management of communities of Web Services" Published in: New Technologies of Distributed Systems (NOTERE), 2010 10th Annual International Conference on Date of Conference: May 31 2010-June 2 2010 Page(s): 97 - 104
[17] Mokarizadeh, S.; R. Inst. of Technol., Stockholm, Sweden; Kungas, P.; Matskin, M. "Utilizing Web Services Networks for Web Service Innovation" Published in: Web Services (ICWS), 2014 IEEE International Conference on Date of Conference: June 27 2014-July 2 2014 Page(s): 646 - 653
[18] Noh-Sam Park; Network Technol. Lab., Electron.& Telecommun. Res. Inst., Daejeon, South Korea; Gil-haeng Lee "Agent-based Web services middleware" Published in: Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE (Volume:6 ) Date of Conference: 1-5 Dec. 2003 Page(s): 3186 - 3190 vol.6
[19] Meng Li; Sch. of Electron. Eng. & Comput. Sci., Peking Univ., Beijing, China; Junfeng Zhao; Lijie Wang; Sibo Cai more authors "CoWS: An Internet-Enriched and Quality-Aware Web Services Search Engine" Published in: Web Services (ICWS), 2011 IEEE International Conference on Date of Conference: 4-9 July 2011 Page(s): 419 - 427
[20] Elgazzar, K.; Sch. of Comput., Queen''s Univ., Kingston, ON, Canada; Hassan, A.E.; Martin, P. "Clustering WSDL Documents to Bootstrap the Discovery of Web Services" Published in: Web Services (ICWS), 2010 IEEE International Conference on Date of Conference: 5-10 July 2010 Page(s): 147 - 154
[21] Cobos, C.; Comput. Sci. Dept., Univ. del Cauca, Popayan, Colombia; Mendoza, M.; Leon, E.; Manic, M. more authors "Clustering of web search results based on an Iterative Fuzzy C-means Algorithm and Bayesian Information Criterion" Published in: IFSA World Congress and NAFIPS Annual Meeting (IFSA/NAFIPS), 2013 Joint Date of Conference: 24-28 June 2013 Page(s): 507 - 512
[22] Agavriloaei, I.; Fac. of Autom. Control & Comput. Eng., Gheorghe Asachi Tech. Univ. of Iasi, Iasi, Romania; Alexandrescu, A.; Craus, M. "Improving web clustering through a new modeling for web documents" Published in: System Theory, Control, and Computing (ICSTCC), 2011 15th International Conference on Date of Conference: 14-16 Oct. 2011 Page(s): 1 - 6

M.Muthamizharasan, "Excavating Evidence since Temporal Performance of Network Convention," International Journal of Computer Sciences and Engineering, Vol.4, Issue.4, pp.384-392, 2016.

In a resource compelled system such as Delay Tolerant Frameworks (DTN), effective utilization of assets such as vitality is vital for optimum system performance. However, due to hubs mobility, frequency of experiences and, message transmission, most of node’s vitality in this type of system is continuously depleted. A node’s vitality in DTN plays an vital role in the success of conveying messages. The lower the vitality a hub has, the lower its possibility to convey messages across the network. Thus, a proper energy-effective steering convention should be selected for message transmission for DTN applications. This issue leads us to research on the vitality utilization of hubs in DTN. We reproduced and, compared several existing steering conventions and, assessed them in terms of normal remaining vitality and, number of dead nodes. Our results show that critical Attributes of these steering conventions contribute to either consuming low or high vitality in conveying messages under certain system settings.

Delay Tolerant Network, Vitality Effective Steering Protocols

[1] Honey Agrawal; Prashant Johri; Arun Kumar, “Emerging trends in energy efficient routing protocols”, Computing, Communication & Automation (ICCCA), 2015 International Conference on, Year: 2015, Pages: 523 – 528.
[2] D. Baghyalakshmi; Jemimah Ebenezer; S. A. V. Satyamurty, “Low latency and energy efficient routing protocols for wireless sensor networks”, Wireless Communication and Sensor Computing, 2010. ICWCSC 2010. International Conference on, Year: 2010, Pages: 1 – 6.
[3] Nikolaos A. Pantazis; Stefanos A. Nikolidakis; Dimitrios D. Vergados, “Energy-Efficient Routing Protocols in Wireless Sensor Networks: A Survey”, IEEE Communications Surveys & Tutorials, Year: 2013, Volume: 15, Issue: 2, Pages: 551 – 591.
[4] Jinhua Zhu; Xin Wang, “Model and Protocol for Energy-Efficient Routing over Mobile Ad Hoc Networks”, IEEE Transactions on Mobile Computing, Year: 2011, Volume: 10, Issue: 11, Pages: 1546 – 1557.
[5] Bhabani Sankar Gouda; Ashish Kumar Dass; K. Lakshmi Narayana, “A comprehensive performance analysis of energy efficient routing protocols in different traffic based mobile ad-hoc networks”, Automation, Computing, Communication, Control and Compressed Sensing (iMac4s), 2013 International Multi-Conference on, Year: 2013,Pages: 306 – 312.
[6] Lijuan Cao; Teresa Dahlberg; Yu Wang, “Performance Evaluation of Energy Efficient Ad Hoc Routing Protocols”, 2007 IEEE International Performance, Computing, and Communications Conference, Year: 2007, Pages: 306 – 313.
[7] Jinhua Zhu; Xin Wang, “PEER: a progressive energy efficient routing protocol for wireless ad hoc networks”, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies, Year: 2005, Volume: 3, Pages: 1887 – 1896.
[8] Dheeraj Kumar Anand; Shiva Prakash, “A Short Survey of Energy-Efficient Routing Protocols for Mobile Ad-Hoc Networks”, Advances in Recent Technologies in Communication and Computing (ARTCom), 2010 International Conference on, Year: 2010, Pages: 327 – 329.
[9] Madan Mohan Agarwal; Mahesh Chandra Govil; Madhavi Sinha, “Investigation of energy efficient routing parameters & protocols”, 2015 Third International Conference on Image Information Processing (ICIIP), Year: 2015, Pages: 168 – 173.
[10] Albert F. Harris; Michele Zorzi, “On the Design of Energy-efficient Routing Protocols in Underwater Networks”, 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc, Communications and Networks, Year: 2007, Pages: 80 – 90.

K.Vetrivel, R.Kayalvizhi, "Probabilistic Misbehaviour Identification in Delay Tolerant Network towards Trust Formation," International Journal of Computer Sciences and Engineering, Vol.4, Issue.4, pp.393-404, 2016.