CFP last date
20 June 2024
Reseach Article

Probabilistic Model to Access the Possible Information using Query Representation

by M.sandhya, B.hanmanthu, B.raghuram
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 107 - Number 2
Year of Publication: 2014
Authors: M.sandhya, B.hanmanthu, B.raghuram
10.5120/18726-9959

M.sandhya, B.hanmanthu, B.raghuram . Probabilistic Model to Access the Possible Information using Query Representation. International Journal of Computer Applications. 107, 2 ( December 2014), 40-44. DOI=10.5120/18726-9959

@article{ 10.5120/18726-9959,
author = { M.sandhya, B.hanmanthu, B.raghuram },
title = { Probabilistic Model to Access the Possible Information using Query Representation },
journal = { International Journal of Computer Applications },
issue_date = { December 2014 },
volume = { 107 },
number = { 2 },
month = { December },
year = { 2014 },
issn = { 0975-8887 },
pages = { 40-44 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume107/number2/18726-9959/ },
doi = { 10.5120/18726-9959 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:40:01.885377+05:30
%A M.sandhya
%A B.hanmanthu
%A B.raghuram
%T Probabilistic Model to Access the Possible Information using Query Representation
%J International Journal of Computer Applications
%@ 0975-8887
%V 107
%N 2
%P 40-44
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The searching of data Process end users search their data needs using query representation, by using this way of retrieving data may not meet their expectations. To achieve end users goal, developers implement several techniques. Previously end users follow greedy algorithm with IQp [1]. But in this paper we will work forward with n-gram Language model. In this approach, end user selects the searchable keyword with the length of minimum n+1 data units. With n data units users failed to retrieve their expectations. This approach includes Probabilistic algorithms used for large vocabulary word correction system with language model. This paper explains data search using n gram data model [5], web server and allows users to interact via browser front end. We outline the challenges and discuss the implementation of our system including results of extensive experimental evaluation.

References
  1. Probabilistic scheme for keyword based incremental query construction - Elena Demidova, Xuan Zhou, and Wolfgang Nejdl, Member, IEEE Computer Society.
  2. G. Zenz, X. Zhou, E. Minack, W. Siberski, and W. Nejdl, "From Keywords to Semantic Queries—Incremental Query Construction on the Semantic Web," J. Web Semantics, vol. 7, no. 3, pp. 166-176,2009.
  3. J. R. Quinlan, "Induction of Decision Trees," Machine Learning,vol. 1, no. 1, pp. 81-106, Mar. 1986. N Grams.
  4. Probabilistic language models, http://dingo. sbs. arizona. edu/~hammond/ling178-sp06/mathCh8. pdf
  5. Spelling correction using N Grams, http://polibits. gelbukh. com/2009_40/40_06. pdf
  6. X. Zhou, G. Zenz, E. Demidova, and W. Nejdl, "SUITS: Constructing Structured Queries from Keywords," technical report, L3S Research Center, Hannover, Germany, http://www. l3s. de/~demidova/suits-TR. pdf, 2008.
  7. Q. Zhou, C. Wang, M. Xiong, H. Wang, and Y. Yu, "SPARK: Adapting Keyword Query to Semantic Search," Proc. Sixth Int'l the Semantic Web and Second Asian Conf. Asian Semantic Web Conf. (ISWC), 2007.
  8. An Improved Error Model for Noisy Channel Spelling Correction Eric Brill and Robert C. Moore Microsoft Research One Microsoft Way Redmond, Wa. 98052 {brill,bobmoore}@microsoft. com.
  9. D. Braga, A. Campi, and S. Ceri, "XQBE (XQuery By Example): A Visual Interface to the Standard XML Query Language," ACM Trans. Database Systems, vol. 30, no. 2, pp. 398-443, 2005.
  10. K. Arnold and J. Gosling, The Java Programming Language, 1996: Addison Wesley.
Index Terms

Computer Science
Information Sciences

Keywords

N-Gram Spell Checker Search Engine Query construction.