Improved Structured Robustness (I-SR): A Novel Approach to Predict Hard Keyword Queries
|
|
- Willis Shaw
- 5 years ago
- Views:
Transcription
1 Journal of Scientific & Industrial Research Vol. 76, January 2017, pp Improved Structured Robustness (I-SR): A Novel Approach to Predict Hard Keyword Queries M S Selvi, K Deepa, M S Sangari* and B Mohankumar Department of IT, Sri Ramakrishna Engineering College, Coimbatore, India Received 03 November 2015; revised 07 August 2016; accepted 10 October 2016 Keyword queries on databases provide easy access to data, but often suffer from low ranking quality, i.e., low precision and/or recall, as shown in recent benchmarks. It would be useful to identify queries that are likely to have low ranking quality to improve the user satisfaction. For instance, the system may suggest to the user alternative queries for such hard queries. In the existing work, analyzes the characteristics of hard queries and propose a novel framework to measure the degree of difficulty for a keyword query over a database, considering both the structure and the content of the database and the query results. However, in this system numbers of issues are there to address. One of the main issues present in the existing work is that, at the time keyword prediction only user submitted keyword will be used for the prediction of the results. The existing work won t concentrate about the semantic meaning present among the key words that are submitted by the users, which will lead to inaccurate result retrieval. To overcome this problem in the proposed work, the semantic based key word prediction is proposed by using ontology-based representation in which the semantic meaning of the keywords will be analyzed by using the Word Net tool. This will lead to an accurate to k retrieval of document due to consideration of the semantic meaning of the documents in search engine. Keywords: Query Search, IR ranking, Structured Robustness, Ontological Annotation Introduction Applications in which plain text coexists with structured data are pervasive. Furthermore, text and structured data are often stored side by side within standard relational database management systems (RDBMSs). Free-form keyword search over RDBMSs has lead to the way of implementing the Ontological search over multiple databases. Given a keyword query, systems such as DBXplorer and DISCOVER join tuples from multiple relations in the database to identify tuple trees with all the query keywords ( AND semantics). All such tuple trees are the answer to the query. Keyword Query Interfaces (KQIs) for databases are used in searching and exploring this data. KQIs identify the information needed behind search of each keyword query. The result of the query is being ranked based on how they satisfy the user intension for searching. The relational databases are searched using Structured Query Language (SQL). The internet users are not able to browse through the complete answer set and are in a urge of getting their search result in the top 10 searches. Keyword search is an efficient *Author for Correspondence senthamilselvi@srec.ac.in mechanism to handle the querying in textual document systems and World Wide Web. The database research community is playing a vital role in introducing keyword search techniques in relational databases XML databases graph databases and heterogeneous data sources, structured and unstructured databases. Keyword search over structured and semi-structured data needs to extract data from different locations which are interconnected and collectively related to query. Given a database D of m objects, each of which is to describe the character by n attributes, a scoring function f, in agreement with to which we rank the object the database D, then a top-k query Q returns the k objects with the highest rank in f efficiently. Instead of all answers, a top-k query returns the subset of most related answers. This leads to the increase in efficient information retrieval techniques for the query search in databases. The notion of ranking robustness (Yun Zhou, 2006), refers to a property of a ranked list of documents that indicates how stable the ranking is in the presence of uncertainty in the ranked documents. The robustness score significantly and consistently correlates with query performance in a variety of TREC test collections including the GOV2 collection. Query performance predictors (Claudia Hauf, 2010)
2 SANGARI et al.: IMPROVED STRUCTURED ROBUSTNESS 39 are evaluated by reporting correlation coefficients to denote how well the methods perform at predicting the retrieval performance of a set of queries but does not concentrate on how strong does the correlation need to be.this issue can be addressed using the context of two settings: Selective Query Expansion and Meta-Search. Here the quality of a predictor is being considered, in order to examine the strength of the correlation achieved, also how it affects the effectiveness of an adaptive retrieval system. The results of this study show that many existing predictors fail to achieve a correlation strong enough to be reliable to improve the retrieval effectiveness in the Selective Query Expansion as well as the Meta- Search setting. Keyword query interfaces (KQIs) (Shiwen Cheng, 2014) for databases provide easy access to data, but often suffer from low ranking quality, i.e. low precision and/or recall, as shown in recent benchmarks. The characteristics of hard queries is analyzed and Shiwen Cheng has proposed a novel framework to measure the degree of difficulty for a keyword query over a database, considering both the structure and the content of the database and the query results. It s being evaluated using keyword search on databases, INEX and SemSearch using prediction algorithms. The evaluation of state of the art query prediction algorithms, both post-retrieval and preretrieval is analyzed based on their sensitivity towards the retrieval algorithm (C. Hauff) by improving the clarity, and demonstrated that it outperforms state-ofthe-art predictors on three standard collections, including two large Web collections. Applications in which plain text coexists with structured data are pervasive. Commercial relational database management systems (RDBMSs) generally provide querying capabilities for text attributes that incorporate stateof-the-art information retrieval (IR) relevance ranking strategies, but this search functionality requires that queries specify the exact column or columns against which a given list of keywords is to be matched (Vagelis Hristidis, 2013). IR-style documentrelevance ranking strategies help to solve the problem of processing free-form keyword queries over RDBMSs by handling queries with both AND and OR semantics, and exploits the sophisticated singlecolumn text-search functionality often available in commercial RDBMSs. Ontology Based Approach for Domain Specific Semantic Information Retrieval Fig.1 Architechture of I-SR algorithm
3 40 J SCI IND RES VOL 76 JANUARY 2017 System (Pratibha. S, 2014) search the required document using conceptual search technique, where the system understands the meanings of the concepts, finds the relations between concepts of users specified queries and then retrieves the semantic answer. This conceptual search technique is implemented by using the concept of ontology. Using this concept, query expansion is performed by converting the input query into a SPARQL query. SPARQL is an RDF database language. SPARQL query is then fired on to the RDF database and accesses the relevant information. Proposed Methodology The Proposed methodology focus on the keyword query search process using ontology with wordnet tool. This paper suggests an efficient Improved Structured Robust (I-SR) Algorithm which provide fast and efficient keyword query result based on the wordnet tool. When the query is being given the meaning of the query is analyzed along with the related information for corresponding query. If the user query includes special characters such as +,space and - for indicating the conjunctive and exclusive situations, those characters are not eliminated and provides semantic meaning for s. Architecture of I-SR Algorithm Initially the original dataset, which contains result set for user queries, has to be stored in the corresponding database. So, each time when user put forth a query search, the query is taken into database to retrieve the corresponding answer for query. In our proposed method, we additionally used WordNet tool for obtaining the useful description about particular Query. The top k result is obtained through PRMS ranking method for semi-structured data. Each time the new keyword instances are underlined, the changes will be done by PRMS ranking method. PRMS utilizes a language model approach to search over structured data. It computes the language model of each attribute value smoothed by the language model of its attribute. It assigns each attribute a query keyword-specific weight, which specifies its contribution in the ranking score. The ranking of the search results is being improved by using ranking algorithm based on the robustness to increase the semantic search answers. The time to retrieve the search data on original and corrupted database is being calculated. Now re-rank the top k results for specific user query. Use the Improved SR algorithm to reduce the overhead time to process the query. This algorithm also focuses on the measurement of difficulty of a query and rankings. It is based on the differences between the rankings of the same query over the original and noisy (corrupted) versions of the same database. I-SR algorithm handles efficiently the corrupted entity, attributes and attribute value using robust score value. So we have to calculate the I-SR score for each user query and result from the database. Finally, we obtain the result after the performance of spearman correlation. Procedure Noise Generation in Databases In order to compute SR, we need to define the noise generation model fxdb (M) for database DB. It shows that each attribute value is corrupted by a combination of three corruption levels: on the value itself, its attribute and its entity set. Now the details: Since the ranking methods for queries over structured data do not generally consider the terms in V that do not belong to query Q, we consider their frequencies to be the same across the original and noisy versions of DB. Given query Q, let be a vector that contains term frequencies for terms w Q V. Similarly, we simplify our model by assuming the attribute values in DB and the terms in Q V are independent. The corruption model must reflect the challenges about search on structured data, where it captures the statistical properties of the query keywords in the attribute values, attributes and entity sets. The introduction of content noise to the attributes and entity sets will propagate down to the attribute values. For instance, if an attribute value of attribute title contains keyword Godfather, then Godfather may appear in any attribute value of attribute title in a corrupted database instance. Similarly, if Godfather appears in an attribute value of entity set movie, then Godfather may appear in any attribute value of entity set movie in a corrupted instance. Ranking in Original Database With the mapping probabilities estimated, the probabilistic retrieval model for semi-structured data (PRMS) can use them as weights for combining the score from each element into a document score, as follows: (1) Here, the mapping probability P M (Ej w) is calculated and the element-level query-likelihood score P QL (w ej) is estimated in the same way as in the HLM approach.
4 SANGARI et al.: IMPROVED STRUCTURED ROBUSTNESS 41 (2) (3) The rationale behind this weighting is that the mapping probability is the result of the inference procedure to decide which element the user may have meant for a given query term. For instance, for the query term `romance', this model assigns higher weight when it is found in genre element as we assume that the user is more likely to have meant a type of movie rather than a word found in plot. One may imagine a case where the user meant `meg ryan' to be words in the title and `romance' to be in the plot. Given that our goal is to make the best guess with the minimal information supplied by user, however, the PRMS will not rank movies that match this interpretation as highly as the more common meaning. Movies that do match this interpretation will, however, appear in the ranking rather than being rejected outright, which would be the case if we were generating structured queries. The experimental results based on collections and queries taken from the actual web services support the claim that the common interpretation is usually correct. Ranking in Corrupted Database With the mapping, probabilities estimated as described above, the probabilistic retrieval model for semi-structured data (PRMS) can use them as weights for combining the score from each element into a document score for same equation. Here, the mapping probability P M (Ej w) is calculated and the elementlevel query-likelihood score P QL (w ej) is estimated in the same way as in the HLM approach. The rationale behind this weighting is that the mapping probability is the result of the inference procedure to decide which element the user may have meant for a given query term. For instance, for the query term `romance', this model assigns higher weight when it is found in genre element as we assume that the user is more likely to have meant a type of movie rather than a word found in plot. One may imagine a case where the user meant `meg ryan' to be words in the title and `romance' to be in the plot. Given that our goal is to make the best guess with the minimal information supplied by user, however, the PRMS will not rank movies that match this interpretation as highly as the more common meaning. Movies that do match this interpretation will, however, appear in the ranking rather than being rejected outright which would be the case if we were generating structured queries. The experimental results based on collections and queries taken from the actual web services support the claim that the common interpretation is usually correct. Improved Structured Robustness (I-SR) Algorithm We compute the similarity of the answer lists using Spearman rank correlation. It ranges between 1 and 1, where 1, 1, and 0 indicate perfect positive correlation, perfect negative correlation, and almost no correlation, respectively. To computes the Structured Robustness score (SR score), for query Q over database DB given retrieval function g: SR(Q,g,DB,XDB)=E{Sim(L(Q,g,DB),L(Q,g,XDB))} (4) where Sim denotes the Spearman rank correlation between the ranked answer lists. Pseudocode : I-SR Algorithm 1 Consider the input query Q, Inverted Index I, Number of relations exist in the ontology R, Finite Set O (Ontology), Similarity word, Top k result List L of Q by ranking function g, Number of corruption iteration N. 2 ISR 0 ; C {}; 3 For i=1 N do 4 For (int i=0; i<word length; i++); 5 WordInformation[i]=Find WordInformation for Words(i) by Wordnet 6 For (j=1; j<r;j++) 7 R= // no.of relations exist in ontology concept. 8 For each concept of ontology 9 If Type (word Type.word) is a noun then 10 Word Distance = word Type. word Get Similarity 11 (concept of ontology), return 12 Build similarity matrix 13 Improve the relevance score value based on the web page counts. 14 Then do the same process for corrupted database. 15 For each result R in L do 16 For each attribute value A in R do 17 Obtain corrupted version of A. 18 For each keyword w in Q do 19 Calculate number of w in corrupted A. 20 Perform for all words in a given query. 21 Read the character after +, - and hyphen using I-SR algorithm.
5 42 J SCI IND RES VOL 76 JANUARY Update all the metadata values. 23 Compute the ranking using function g and correlation method. 24 Obtain ISR result with semantic result using ontology concept. 25 Return ISR+=Semantic and Similarity top k result (L, ) Simulation and Results The simulation is done using java. The INEX 2010 data centric database set is used and the following parameters are being analyzed. Recall Recall value is calculated based on the retrieval of information at true positive prediction, false negative. Data precision is calculated based on the percentage of positive results returned and is also referred to as the True Positive Rate. proposed system. Finally we can prove that our proposed scenario is efficient to existing algorithms. Conclusions and Future Work In the existing work, analyzes the characteristics of hard queries and propose a novel framework to measure the degree of difficulty for a keyword query over a database, considering both the structure and the content of the database and the query results. However, in this system numbers of issues are there to address. They are, searching quality is lower than the other system and reliability rate of the system is lowest. In order to overcome these drawbacks, we are proposing the improved ranking algorithm which is used to enhance the accuracy rate of the system. This proposed system is well enhancing the reliability Recall = (6) We use Improved Structured Robustness algorithm in proposed scenario to build high accurate results. For number of queries it generates the higher recall values in current scenario. Finally we can say that our proposed system is higher performance than existing scenario. Precision Precision value is calculated is based on the retrieval of information at true positive prediction, false positive. Fig.2 Precision parameter graph Precision = (7) From this figure given below, we can conclude that our proposed scenario produce maximum precision values rather than our existing scenario. By using I-SR method, proposed system achieves high precision values compare than SR method in existing system. Thus, we achieve the result in greater for proposed system rather than the existing system. Time Parameter From the graph generated, it is being found that the time taken is long in existing scenario and low in proposed scenario. We use ontology with wordnet tool hence it extracts the necessity answer set fast and efficient with relevant top k results. By using proposed I-SR with ontology concept, it takes minimum amount of time for computation in Fig.3 Time Parameter Graph
6 SANGARI et al.: IMPROVED STRUCTURED ROBUSTNESS 43 rate of the difficult query prediction system. Some query topics contain characters +" and " to indicate the conjunctive and exclusive conditions. In the existing system, we do not use these conditions and remove the keywords after character ". In our proposed difficult query prediction system, use these operators to improve search quality. In other words, this work is support these operators for efficient result. Additionally we proposed the concept of ontology based Word Net tool for improving the top k results efficiency. It is used for providing not only similar words but also semantic meaning for the given word query. From the experimentation result, we are obtaining the proposed system is well effective than the existing system by means of accuracy rate, quality of result and short threshold time. References 1 Cheng S, Termehchy A & Hristidis V, Efficient prediction of difficult keyword queries over databases, IEEE Transactions on Knowledge and Data Engineering, Vol 26, no 6 (2014) Hristidis V, Gravano L & Papakonstantinou Y, Efficient IR-style keyword searches over relational databases, Proc 29th Int VLDB Conf, Berlin, Germany, (2003) Ganti V, He Y & Xin D, Keyword++: A framework to improve keyword search over entity databases, Proc VLDB Endowment, Singapore, Vol 3, no 1 2, (2010) Bhalotia G, Hulgeri A, Nakhe C, Chakrabarti S & Sudarshan S, Keyword searching and browsing in databases using BANKS, Proc. 18th Int Conf ICDE, San Jose, CA, USA, (2002) Zhou Y & Croft B, Ranking Robustness: A novel framework to predict query performance, Proc 15th Int Conf ACM, CIKM, Geneva, Switzerland, (2006) Collins-Thompson K & Bennett P N, Predicting query performance via classification, Proc 32nd Int Conf ECIR, Milton Keynes, UK, (2010) Shtok A, Kurland O & Carmel D, Predicting query performance by query-qrift estimation, Proc 2nd Int Conf TIR, Heidelberg, Germany, (2009) Zhao Y, Scholer F & Tsegay Y, Effective pre-retrieval query performance prediction using similarity and variability evidence, Proc 30th Int Conf ECIR, Berlin, Germany, (2008) Hauff C, Murdock V & Baeza-Yates R, Improved query difficulty prediction for the web, Proc 17th Int Conf CIKM, Napa Valley, CA, USA, (2008) Hauff C, Azzopardi L, Hiemstra D & Jong F, Query performance prediction: evaluation contrasted with effectiveness, Proc 32nd Int Conf ECIR, Milton Keynes, UK, (2010) Vishal Jain & Prasad S VAV, Ontology based information retrieval model in semantic web: A review, Proc IJARCSSE, Vol 4, Issue No 8, (2014) Tim Finin, James Mayfield, Anupam Joshi, Scott Cost R & Clay Fink., Information retrieval and the semantic web, Proc 11th Int Conf on Information and Knowledge Management (2002) Antonio Sanfilippo, Stephen Tratz, Michelle Gregory, Alan Chappell, Paul Whitney, Christian Posse, Patrick Paulson, Bob Baddeley., Ryan Hohimer & Amanda White, Ontological Annotation with WordNet, Proc Pacific Northwest National Laboratory,902 Battelle Blvd, Richland, (2005) Pratibha S, Sonakneware & Karale SJ, Ontology based approach for domain specific semantic information retrieval system, International Journal of Engineering Research and Applications (2014)
EFFICIENT APPROACH FOR DETECTING HARD KEYWORD QUERIES WITH MULTI-LEVEL NOISE GENERATION
EFFICIENT APPROACH FOR DETECTING HARD KEYWORD QUERIES WITH MULTI-LEVEL NOISE GENERATION B.Mohankumar 1, Dr. P. Marikkannu 2, S. Jansi Rani 3, S. Suganya 4 1 3 4Asst Prof, Department of Information Technology,
More informationA Novel Framework for Predicting Hard Keyword Queries on Databases using Ontology Concepts
A Novel Framework for Predicting Hard Keyword Queries on Databases using Ontology Concepts B.Mohankumar, Dr. P. Marikkannu, S. Suganya Department of IT, Sri Ramakrishna Engineering College, Coimbatore,
More informationOntology Based Prediction of Difficult Keyword Queries
Ontology Based Prediction of Difficult Keyword Queries Lubna.C*, Kasim K Pursuing M.Tech (CSE)*, Associate Professor (CSE) MEA Engineering College, Perinthalmanna Kerala, India lubna9990@gmail.com, kasim_mlp@gmail.com
More informationEfficient Prediction of Difficult Keyword Queries over Databases
Efficient Prediction of Difficult Keyword Queries over Databases Gurramkonda Lakshmi Priyanka P.G. Scholar (M. Tech), Department of CSE, Srinivasa Institute of Technology & Sciences, Ukkayapalli, Kadapa,
More informationISSN Vol.08,Issue.18, October-2016, Pages:
ISSN 2348 2370 Vol.08,Issue.18, October-2016, Pages:3571-3578 www.ijatir.org Efficient Prediction of Difficult Keyword Queries Over Data Bases SHALINI ATLA 1, DEEPTHI JANAGAMA 2 1 PG Scholar, Dept of CSE,
More informationISSN Vol.05,Issue.07, July-2017, Pages:
WWW.IJITECH.ORG ISSN 2321-8665 Vol.05,Issue.07, July-2017, Pages:1320-1324 Efficient Prediction of Difficult Keyword Queries over Databases KYAMA MAHESH 1, DEEPTHI JANAGAMA 2, N. ANJANEYULU 3 1 PG Scholar,
More informationNavigating the User Query Space
Navigating the User Query Space Ronan Cummins 1, Mounia Lalmas 2, Colm O Riordan 3 and Joemon M. Jose 1 1 School of Computing Science, University of Glasgow, UK 2 Yahoo! Research, Barcelona, Spain 3 Dept.
More informationKEYWORD query interfaces (KQIs) for databases have
1 Efficient Prediction of Difficult Keyword Queries over Databases Shiwen Cheng, Arash Termehchy, and Vagelis Hristidis Abstract Keyword queries on databases provide easy access to data, but often suffer
More informationPredicting Query Performance on the Web
Predicting Query Performance on the Web No Author Given Abstract. Predicting performance of queries has many useful applications like automatic query reformulation and automatic spell correction. However,
More informationSupporting Fuzzy Keyword Search in Databases
I J C T A, 9(24), 2016, pp. 385-391 International Science Press Supporting Fuzzy Keyword Search in Databases Jayavarthini C.* and Priya S. ABSTRACT An efficient keyword search system computes answers as
More informationKeyword search in relational databases. By SO Tsz Yan Amanda & HON Ka Lam Ethan
Keyword search in relational databases By SO Tsz Yan Amanda & HON Ka Lam Ethan 1 Introduction Ubiquitous relational databases Need to know SQL and database structure Hard to define an object 2 Query representation
More informationPredicting the Effectiveness of Keyword Queries on Databases
Predicting the Effectiveness of Keyword Queries on Databases Shiwen Cheng Department of Computer Science & Engineering University of California at Riverside Riverside, CA 92507. USA schen064@cs.ucr.edu
More informationTop-k Keyword Search Over Graphs Based On Backward Search
Top-k Keyword Search Over Graphs Based On Backward Search Jia-Hui Zeng, Jiu-Ming Huang, Shu-Qiang Yang 1College of Computer National University of Defense Technology, Changsha, China 2College of Computer
More informationVolume 2, Issue 11, November 2014 International Journal of Advance Research in Computer Science and Management Studies
Volume 2, Issue 11, November 2014 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online at: www.ijarcsms.com
More informationUsing a Medical Thesaurus to Predict Query Difficulty
Using a Medical Thesaurus to Predict Query Difficulty Florian Boudin, Jian-Yun Nie, Martin Dawes To cite this version: Florian Boudin, Jian-Yun Nie, Martin Dawes. Using a Medical Thesaurus to Predict Query
More informationEffective Top-k Keyword Search in Relational Databases Considering Query Semantics
Effective Top-k Keyword Search in Relational Databases Considering Query Semantics Yanwei Xu 1,2, Yoshiharu Ishikawa 1, and Jihong Guan 2 1 Graduate School of Information Science, Nagoya University, Japan
More informationEvaluation of Keyword Search System with Ranking
Evaluation of Keyword Search System with Ranking P.Saranya, Dr.S.Babu UG Scholar, Department of CSE, Final Year, IFET College of Engineering, Villupuram, Tamil nadu, India Associate Professor, Department
More informationInformation Retrieval Using Keyword Search Technique
Information Retrieval Using Keyword Search Technique Dhananjay A. Gholap, Dr.Gumaste S. V Department of Computer Engineering, Sharadchandra Pawar College of Engineering, Dumbarwadi, Otur, Pune, India ABSTRACT:
More informationSemi supervised clustering for Text Clustering
Semi supervised clustering for Text Clustering N.Saranya 1 Assistant Professor, Department of Computer Science and Engineering, Sri Eshwar College of Engineering, Coimbatore 1 ABSTRACT: Based on clustering
More informationUsing Coherence-based Measures to Predict Query Difficulty
Using Coherence-based Measures to Predict Query Difficulty Jiyin He, Martha Larson, and Maarten de Rijke ISLA, University of Amsterdam {jiyinhe,larson,mdr}@science.uva.nl Abstract. We investigate the potential
More informationIJESRT. Scientific Journal Impact Factor: (ISRA), Impact Factor: 2.114
[Saranya, 4(3): March, 2015] ISSN: 2277-9655 IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY A SURVEY ON KEYWORD QUERY ROUTING IN DATABASES N.Saranya*, R.Rajeshkumar, S.Saranya
More informationCitation for published version (APA): He, J. (2011). Exploring topic structure: Coherence, diversity and relatedness
UvA-DARE (Digital Academic Repository) Exploring topic structure: Coherence, diversity and relatedness He, J. Link to publication Citation for published version (APA): He, J. (211). Exploring topic structure:
More informationISSN: (Online) Volume 2, Issue 3, March 2014 International Journal of Advance Research in Computer Science and Management Studies
ISSN: 2321-7782 (Online) Volume 2, Issue 3, March 2014 International Journal of Advance Research in Computer Science and Management Studies Research Article / Paper / Case Study Available online at: www.ijarcsms.com
More informationA Study on Reverse Top-K Queries Using Monochromatic and Bichromatic Methods
A Study on Reverse Top-K Queries Using Monochromatic and Bichromatic Methods S.Anusuya 1, M.Balaganesh 2 P.G. Student, Department of Computer Science and Engineering, Sembodai Rukmani Varatharajan Engineering
More informationPrinciples of Dataspaces
Principles of Dataspaces Seminar From Databases to Dataspaces Summer Term 2007 Monika Podolecheva University of Konstanz Department of Computer and Information Science Tutor: Prof. M. Scholl, Alexander
More informationUMass at TREC 2017 Common Core Track
UMass at TREC 2017 Common Core Track Qingyao Ai, Hamed Zamani, Stephen Harding, Shahrzad Naseri, James Allan and W. Bruce Croft Center for Intelligent Information Retrieval College of Information and Computer
More informationImproving the Efficiency of Fast Using Semantic Similarity Algorithm
International Journal of Scientific and Research Publications, Volume 4, Issue 1, January 2014 1 Improving the Efficiency of Fast Using Semantic Similarity Algorithm D.KARTHIKA 1, S. DIVAKAR 2 Final year
More informationWeb Information Retrieval using WordNet
Web Information Retrieval using WordNet Jyotsna Gharat Asst. Professor, Xavier Institute of Engineering, Mumbai, India Jayant Gadge Asst. Professor, Thadomal Shahani Engineering College Mumbai, India ABSTRACT
More informationTime-aware Approaches to Information Retrieval
Time-aware Approaches to Information Retrieval Nattiya Kanhabua Department of Computer and Information Science Norwegian University of Science and Technology 24 February 2012 Motivation Searching documents
More informationEffective Semantic Search over Huge RDF Data
Effective Semantic Search over Huge RDF Data 1 Dinesh A. Zende, 2 Chavan Ganesh Baban 1 Assistant Professor, 2 Post Graduate Student Vidya Pratisthan s Kamanayan Bajaj Institute of Engineering & Technology,
More informationA Novel Framework to Measure the Degree of Difficulty on Keyword Query Routing
ISSN (Online): 2349-7084 GLOBAL IMPACT FACTOR 0.238 DIIF 0.876 A Novel Framework to Measure the Degree of Difficulty on Keyword Query Routing 1 Kallem Rajender Reddy, 2 Y.Sunitha 1 M.Tech (CS),Department
More informationEffect of log-based Query Term Expansion on Retrieval Effectiveness in Patent Searching
Effect of log-based Query Term Expansion on Retrieval Effectiveness in Patent Searching Wolfgang Tannebaum, Parvaz Madabi and Andreas Rauber Institute of Software Technology and Interactive Systems, Vienna
More informationRELATIVE QUERY RESULTS RANKING FOR ONLINE USERS IN WEB DATABASES
RELATIVE QUERY RESULTS RANKING FOR ONLINE USERS IN WEB DATABASES Pramod Kumar Ghadei Research Scholar, Sathyabama University, Chennai, Tamil Nadu, India pramod-ghadei@yahoo.com Dr. S. Sridhar Research
More informationAnnotating Multiple Web Databases Using Svm
Annotating Multiple Web Databases Using Svm M.Yazhmozhi 1, M. Lavanya 2, Dr. N. Rajkumar 3 PG Scholar, Department of Software Engineering, Sri Ramakrishna Engineering College, Coimbatore, India 1, 3 Head
More informationImplementation of Skyline Sweeping Algorithm
Implementation of Skyline Sweeping Algorithm BETHINEEDI VEERENDRA M.TECH (CSE) K.I.T.S. DIVILI Mail id:veeru506@gmail.com B.VENKATESWARA REDDY Assistant Professor K.I.T.S. DIVILI Mail id: bvr001@gmail.com
More informationAchieving effective keyword ranked search by using TF-IDF and cosine similarity
Achieving effective keyword ranked search by using TF-IDF and cosine similarity M.PRADEEPA 1, V.MOHANRAJ 2 1PG scholar department of IT, Sona College of Technology,Tamilnadu,India. pradeepa92.murugan@gmail.com
More informationINTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN EFFECTIVE KEYWORD SEARCH OF FUZZY TYPE IN XML
INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 EFFECTIVE KEYWORD SEARCH OF FUZZY TYPE IN XML Mr. Mohammed Tariq Alam 1,Mrs.Shanila Mahreen 2 Assistant Professor
More informationA New Technique to Optimize User s Browsing Session using Data Mining
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 4, Issue. 3, March 2015,
More informationCluster-based Instance Consolidation For Subsequent Matching
Jennifer Sleeman and Tim Finin, Cluster-based Instance Consolidation For Subsequent Matching, First International Workshop on Knowledge Extraction and Consolidation from Social Media, November 2012, Boston.
More informationApplying the KISS Principle for the CLEF- IP 2010 Prior Art Candidate Patent Search Task
Applying the KISS Principle for the CLEF- IP 2010 Prior Art Candidate Patent Search Task Walid Magdy, Gareth J.F. Jones Centre for Next Generation Localisation School of Computing Dublin City University,
More informationEffective Keyword Search in Relational Databases for Lyrics
Effective Keyword Search in Relational Databases for Lyrics Navin Kumar Trivedi Assist. Professor, Department of Computer Science & Information Technology Divya Singh B.Tech (CSe) Scholar Pooja Pandey
More informationA Survey Of Different Text Mining Techniques Varsha C. Pande 1 and Dr. A.S. Khandelwal 2
A Survey Of Different Text Mining Techniques Varsha C. Pande 1 and Dr. A.S. Khandelwal 2 1 Department of Electronics & Comp. Sc, RTMNU, Nagpur, India 2 Department of Computer Science, Hislop College, Nagpur,
More informationIJREAT International Journal of Research in Engineering & Advanced Technology, Volume 1, Issue 5, Oct-Nov, 2013 ISSN:
Semi Automatic Annotation Exploitation Similarity of Pics in i Personal Photo Albums P. Subashree Kasi Thangam 1 and R. Rosy Angel 2 1 Assistant Professor, Department of Computer Science Engineering College,
More informationWEIGHTING QUERY TERMS USING WORDNET ONTOLOGY
IJCSNS International Journal of Computer Science and Network Security, VOL.9 No.4, April 2009 349 WEIGHTING QUERY TERMS USING WORDNET ONTOLOGY Mohammed M. Sakre Mohammed M. Kouta Ali M. N. Allam Al Shorouk
More informationDepartment of Computer Engineering, Sharadchandra Pawar College of Engineering, Dumbarwadi, Otur, Pune, Maharashtra, India
Volume 5, Issue 6, June 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Information Retrieval
More informationInformation Retrieval (IR) through Semantic Web (SW): An Overview
Information Retrieval (IR) through Semantic Web (SW): An Overview Gagandeep Singh 1, Vishal Jain 2 1 B.Tech (CSE) VI Sem, GuruTegh Bahadur Institute of Technology, GGS Indraprastha University, Delhi 2
More informationContent-based Dimensionality Reduction for Recommender Systems
Content-based Dimensionality Reduction for Recommender Systems Panagiotis Symeonidis Aristotle University, Department of Informatics, Thessaloniki 54124, Greece symeon@csd.auth.gr Abstract. Recommender
More informationKeywords Data alignment, Data annotation, Web database, Search Result Record
Volume 5, Issue 8, August 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Annotating Web
More informationKeyword query interpretation over structured data
Keyword query interpretation over structured data Advanced Methods of Information Retrieval Elena Demidova SS 2018 Elena Demidova: Advanced Methods of Information Retrieval SS 2018 1 Recap Elena Demidova:
More informationTERM BASED WEIGHT MEASURE FOR INFORMATION FILTERING IN SEARCH ENGINES
TERM BASED WEIGHT MEASURE FOR INFORMATION FILTERING IN SEARCH ENGINES Mu. Annalakshmi Research Scholar, Department of Computer Science, Alagappa University, Karaikudi. annalakshmi_mu@yahoo.co.in Dr. A.
More informationExtending Keyword Search to Metadata in Relational Database
DEWS2008 C6-1 Extending Keyword Search to Metadata in Relational Database Jiajun GU Hiroyuki KITAGAWA Graduate School of Systems and Information Engineering Center for Computational Sciences University
More informationSEMANTIC WEB POWERED PORTAL INFRASTRUCTURE
SEMANTIC WEB POWERED PORTAL INFRASTRUCTURE YING DING 1 Digital Enterprise Research Institute Leopold-Franzens Universität Innsbruck Austria DIETER FENSEL Digital Enterprise Research Institute National
More informationIJCSC Volume 5 Number 1 March-Sep 2014 pp ISSN
Movie Related Information Retrieval Using Ontology Based Semantic Search Tarjni Vyas, Hetali Tank, Kinjal Shah Nirma University, Ahmedabad tarjni.vyas@nirmauni.ac.in, tank92@gmail.com, shahkinjal92@gmail.com
More informationKeyword query interpretation over structured data
Keyword query interpretation over structured data Advanced Methods of IR Elena Demidova Materials used in the slides: Jeffrey Xu Yu, Lu Qin, Lijun Chang. Keyword Search in Databases. Synthesis Lectures
More informationTaccumulation of the social network data has raised
International Journal of Advanced Research in Social Sciences, Environmental Studies & Technology Hard Print: 2536-6505 Online: 2536-6513 September, 2016 Vol. 2, No. 1 Review Social Network Analysis and
More informationClosest Keywords Search on Spatial Databases
Closest Keywords Search on Spatial Databases 1 A. YOJANA, 2 Dr. A. SHARADA 1 M. Tech Student, Department of CSE, G.Narayanamma Institute of Technology & Science, Telangana, India. 2 Associate Professor,
More informationAn Overview of various methodologies used in Data set Preparation for Data mining Analysis
An Overview of various methodologies used in Data set Preparation for Data mining Analysis Arun P Kuttappan 1, P Saranya 2 1 M. E Student, Dept. of Computer Science and Engineering, Gnanamani College of
More informationA Framework for Securing Databases from Intrusion Threats
A Framework for Securing Databases from Intrusion Threats R. Prince Jeyaseelan James Department of Computer Applications, Valliammai Engineering College Affiliated to Anna University, Chennai, India Email:
More informationOntology Extraction from Heterogeneous Documents
Vol.3, Issue.2, March-April. 2013 pp-985-989 ISSN: 2249-6645 Ontology Extraction from Heterogeneous Documents Kirankumar Kataraki, 1 Sumana M 2 1 IV sem M.Tech/ Department of Information Science & Engg
More informationA Survey on Efficient Location Tracker Using Keyword Search
A Survey on Efficient Location Tracker Using Keyword Search Prasad Prabhakar Joshi, Anand Bone ME Student, Smt. Kashibai Navale Sinhgad Institute of Technology and Science Kusgaon (Budruk), Lonavala, Pune,
More informationA Technique to Improve Difficult Keyword Queries Over Database
A Technique to Improve Difficult Keyword Queries Over Database Deepti S. Deshmukh 1, Simran Khiani 2 1 M.E. Computer Networks Student, G.H. Raisoni Collage of Engineering and Management, Wagholi, Pune,
More informationSearching SNT in XML Documents Using Reduction Factor
Searching SNT in XML Documents Using Reduction Factor Mary Posonia A Department of computer science, Sathyabama University, Tamilnadu, Chennai, India maryposonia@sathyabamauniversity.ac.in http://www.sathyabamauniversity.ac.in
More informationA Survey on Keyword Diversification Over XML Data
ISSN (Online) : 2319-8753 ISSN (Print) : 2347-6710 International Journal of Innovative Research in Science, Engineering and Technology An ISO 3297: 2007 Certified Organization Volume 6, Special Issue 5,
More informationAutomatic Generation of Query Sessions using Text Segmentation
Automatic Generation of Query Sessions using Text Segmentation Debasis Ganguly, Johannes Leveling, and Gareth J.F. Jones CNGL, School of Computing, Dublin City University, Dublin-9, Ireland {dganguly,
More informationIntranet Search. Exploiting Databases for Document Retrieval. Christoph Mangold Universität Stuttgart
Intranet Search Exploiting Databases for Document Retrieval Christoph Mangold Universität Stuttgart 2 /6 The Big Picture: Assume. there is a glueing problem with product P7 Has this happened before? Is
More informationKeyword Join: Realizing Keyword Search in P2P-based Database Systems
Keyword Join: Realizing Keyword Search in P2P-based Database Systems Bei Yu, Ling Liu 2, Beng Chin Ooi 3 and Kian-Lee Tan 3 Singapore-MIT Alliance 2 Georgia Institute of Technology, 3 National University
More informationINTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY A PATH FOR HORIZING YOUR INNOVATIVE WORK REVIEW PAPER ON IMPLEMENTATION OF DOCUMENT ANNOTATION USING CONTENT AND QUERYING
More informationPresented by: Dimitri Galmanovich. Petros Venetis, Alon Halevy, Jayant Madhavan, Marius Paşca, Warren Shen, Gengxin Miao, Chung Wu
Presented by: Dimitri Galmanovich Petros Venetis, Alon Halevy, Jayant Madhavan, Marius Paşca, Warren Shen, Gengxin Miao, Chung Wu 1 When looking for Unstructured data 2 Millions of such queries every day
More informationIJREAT International Journal of Research in Engineering & Advanced Technology, Volume 1, Issue 5, Oct-Nov, ISSN:
IJREAT International Journal of Research in Engineering & Advanced Technology, Volume 1, Issue 5, Oct-Nov, 20131 Improve Search Engine Relevance with Filter session Addlin Shinney R 1, Saravana Kumar T
More informationDbSurfer: A Search and Navigation Tool for Relational Databases
DbSurfer: A Search and Navigation Tool for Relational Databases Richard Wheeldon, Mark Levene and Kevin Keenoy School of Computer Science and Information Systems Birkbeck University of London Malet St,
More informationImproving Information Retrieval Effectiveness in Peer-to-Peer Networks through Query Piggybacking
Improving Information Retrieval Effectiveness in Peer-to-Peer Networks through Query Piggybacking Emanuele Di Buccio, Ivano Masiero, and Massimo Melucci Department of Information Engineering, University
More informationInformation Retrieval On The Semantic Web
Information Retrieval On The Semantic Web Urvi Shah TripleHop Technologies, Inc New York, NY 10010 urvi@triplehop.com Tim Finin Dept. Comp. Sci. University of Maryland Baltimore County Baltimore, MD 21227
More informationToward Entity Retrieval over Structured and Text Data
Toward Entity Retrieval over Structured and Text Data Mayssam Sayyadian, Azadeh Shakery, AnHai Doan, ChengXiang Zhai Department of Computer Science, University of Illinois at Urbana-Champaign {sayyadia,
More informationDatabases and Information Retrieval Integration TIETS42. Kostas Stefanidis Autumn 2016
+ Databases and Information Retrieval Integration TIETS42 Autumn 2016 Kostas Stefanidis kostas.stefanidis@uta.fi http://www.uta.fi/sis/tie/dbir/index.html http://people.uta.fi/~kostas.stefanidis/dbir16/dbir16-main.html
More informationAn Efficient Methodology for Image Rich Information Retrieval
An Efficient Methodology for Image Rich Information Retrieval 56 Ashwini Jaid, 2 Komal Savant, 3 Sonali Varma, 4 Pushpa Jat, 5 Prof. Sushama Shinde,2,3,4 Computer Department, Siddhant College of Engineering,
More informationMEASURING SEMANTIC SIMILARITY BETWEEN WORDS AND IMPROVING WORD SIMILARITY BY AUGUMENTING PMI
MEASURING SEMANTIC SIMILARITY BETWEEN WORDS AND IMPROVING WORD SIMILARITY BY AUGUMENTING PMI 1 KAMATCHI.M, 2 SUNDARAM.N 1 M.E, CSE, MahaBarathi Engineering College Chinnasalem-606201, 2 Assistant Professor,
More informationLily: Ontology Alignment Results for OAEI 2009
Lily: Ontology Alignment Results for OAEI 2009 Peng Wang 1, Baowen Xu 2,3 1 College of Software Engineering, Southeast University, China 2 State Key Laboratory for Novel Software Technology, Nanjing University,
More informationRanking models in Information Retrieval: A Survey
Ranking models in Information Retrieval: A Survey R.Suganya Devi Research Scholar Department of Computer Science and Engineering College of Engineering, Guindy, Chennai, Tamilnadu, India Dr D Manjula Professor
More informationQUERY RECOMMENDATION SYSTEM USING USERS QUERYING BEHAVIOR
International Journal of Emerging Technology and Innovative Engineering QUERY RECOMMENDATION SYSTEM USING USERS QUERYING BEHAVIOR V.Megha Dept of Computer science and Engineering College Of Engineering
More informationSecure and Advanced Best Keyword Cover Search over Spatial Database
Secure and Advanced Best Keyword Cover Search over Spatial Database Sweety Thakare 1, Pritam Patil 2, Tarade Priyanka 3, Sonawane Prajakta 4, Prof. Pathak K.R. 4 B. E Student, Dept. of Computer Engineering,
More informationImproving Difficult Queries by Leveraging Clusters in Term Graph
Improving Difficult Queries by Leveraging Clusters in Term Graph Rajul Anand and Alexander Kotov Department of Computer Science, Wayne State University, Detroit MI 48226, USA {rajulanand,kotov}@wayne.edu
More informationCS473: Course Review CS-473. Luo Si Department of Computer Science Purdue University
CS473: CS-473 Course Review Luo Si Department of Computer Science Purdue University Basic Concepts of IR: Outline Basic Concepts of Information Retrieval: Task definition of Ad-hoc IR Terminologies and
More informationImproving the Performance of the Peer to Peer Network by Introducing an Assortment of Methods
Journal of Computer Science 7 (1): 32-38, 2011 ISSN 1549-3636 2011 Science Publications Improving the Performance of the Peer to Peer Network by Introducing an Assortment of Methods 1 M. Sadish Sendil
More informationHolistic and Compact Selectivity Estimation for Hybrid Queries over RDF Graphs
Holistic and Compact Selectivity Estimation for Hybrid Queries over RDF Graphs Authors: Andreas Wagner, Veli Bicer, Thanh Tran, and Rudi Studer Presenter: Freddy Lecue IBM Research Ireland 2014 International
More informationRECORD DEDUPLICATION USING GENETIC PROGRAMMING APPROACH
Int. J. Engg. Res. & Sci. & Tech. 2013 V Karthika et al., 2013 Research Paper ISSN 2319-5991 www.ijerst.com Vol. 2, No. 2, May 2013 2013 IJERST. All Rights Reserved RECORD DEDUPLICATION USING GENETIC PROGRAMMING
More informationCHAPTER 6 PROPOSED HYBRID MEDICAL IMAGE RETRIEVAL SYSTEM USING SEMANTIC AND VISUAL FEATURES
188 CHAPTER 6 PROPOSED HYBRID MEDICAL IMAGE RETRIEVAL SYSTEM USING SEMANTIC AND VISUAL FEATURES 6.1 INTRODUCTION Image representation schemes designed for image retrieval systems are categorized into two
More informationIntegrating and Querying Source Code of Programs Working on a Database
Integrating and Querying Source Code of Working on a Database Carlos Garcia-Alvarado University of Houston Dept. of Computer Science Houston, TX, USA Carlos Ordonez University of Houston Dept. of Computer
More informationCorrelation Based Feature Selection with Irrelevant Feature Removal
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 4, April 2014,
More informationInternational Journal of Data Mining & Knowledge Management Process (IJDKP) Vol.7, No.3, May Dr.Zakea Il-Agure and Mr.Hicham Noureddine Itani
LINK MINING PROCESS Dr.Zakea Il-Agure and Mr.Hicham Noureddine Itani Higher Colleges of Technology, United Arab Emirates ABSTRACT Many data mining and knowledge discovery methodologies and process models
More informationRobust Relevance-Based Language Models
Robust Relevance-Based Language Models Xiaoyan Li Department of Computer Science, Mount Holyoke College 50 College Street, South Hadley, MA 01075, USA Email: xli@mtholyoke.edu ABSTRACT We propose a new
More informationVisualizing semantic table annotations with TableMiner+
Visualizing semantic table annotations with TableMiner+ MAZUMDAR, Suvodeep and ZHANG, Ziqi Available from Sheffield Hallam University Research Archive (SHURA) at:
More informationResults and Discussions on Transaction Splitting Technique for Mining Differential Private Frequent Itemsets
Results and Discussions on Transaction Splitting Technique for Mining Differential Private Frequent Itemsets Sheetal K. Labade Computer Engineering Dept., JSCOE, Hadapsar Pune, India Srinivasa Narasimha
More informationA Document-centered Approach to a Natural Language Music Search Engine
A Document-centered Approach to a Natural Language Music Search Engine Peter Knees, Tim Pohle, Markus Schedl, Dominik Schnitzer, and Klaus Seyerlehner Dept. of Computational Perception, Johannes Kepler
More informationChapter 27 Introduction to Information Retrieval and Web Search
Chapter 27 Introduction to Information Retrieval and Web Search Copyright 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 27 Outline Information Retrieval (IR) Concepts Retrieval
More informationOntology Matching with CIDER: Evaluation Report for the OAEI 2008
Ontology Matching with CIDER: Evaluation Report for the OAEI 2008 Jorge Gracia, Eduardo Mena IIS Department, University of Zaragoza, Spain {jogracia,emena}@unizar.es Abstract. Ontology matching, the task
More informationQuery Likelihood with Negative Query Generation
Query Likelihood with Negative Query Generation Yuanhua Lv Department of Computer Science University of Illinois at Urbana-Champaign Urbana, IL 61801 ylv2@uiuc.edu ChengXiang Zhai Department of Computer
More informationRanked Keyword Query on Semantic Web Data
2010 Seventh International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2010) Ranked Keyword Query on Semantic Web Data Huiying Li School of Computer Science and Engineering Southeast University
More informationSelecting Topics for Web Resource Discovery: Efficiency Issues in a Database Approach +
Selecting Topics for Web Resource Discovery: Efficiency Issues in a Database Approach + Abdullah Al-Hamdani, Gultekin Ozsoyoglu Electrical Engineering and Computer Science Dept, Case Western Reserve University,
More informationPowered Outer Probabilistic Clustering
Proceedings of the World Congress on Engineering and Computer Science 217 Vol I WCECS 217, October 2-27, 217, San Francisco, USA Powered Outer Probabilistic Clustering Peter Taraba Abstract Clustering
More informationRelevance Feature Discovery for Text Mining
Relevance Feature Discovery for Text Mining Laliteshwari 1,Clarish 2,Mrs.A.G.Jessy Nirmal 3 Student, Dept of Computer Science and Engineering, Agni College Of Technology, India 1,2 Asst Professor, Dept
More information