Discovery of Knowledge from Query Groups

  • Sunita A. Yadwad
  • M. Pavani
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 247)


Now a day’s web usage is increasing and most of the queries submitted to server are informational rather than navigational. Users access complicated informational and task-oriented goals like arranging for travelling, managing banking transactions, or planning their decisions on buying new products. However, the primary option for accessing data on-line continues to be through keyword search. A complex task such as managing bank transactions should be broken down into a number of subtasks (queries) over a period of time. As an example, a user may first search on target accounts branch names, etc. So there is need for maintaining user search history which incorporates a sequence of four queries displayed in reverse timely order together with their corresponding U.R.L clicks. This paper explains the how to maintain user search history and missing knowledge from query group. This paper uses one pass algorithm in order to generate knowledge from user search groups.


Query groups Sliding window model knowledge discovery 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Spink, A., Park, M., Jansen, B.J., Pedersen, J.: Multitasking during Web Search Sessions. Information Processing and Management 42(1), 264–275 (2006)CrossRefGoogle Scholar
  2. 2.
    Boldi, P., Bonchi, F., Castillo, C., Donato, D., Gionis, A., Vigna, S.: The Query-Flow Graph: Model and Applications. In: Proc. 17th ACM Conf. Information and Knowledge Management, CIKM (2008)Google Scholar
  3. 3.
    Baeza-Yates, R., Tiberi, A.: Extracting Semantic Relations from Query Logs. In: Proc. 13th ACM SIGKDD Int’l Conf. Knowledge Discovery and Data Mining, KDD (2007)Google Scholar
  4. 4.
    Barbakh, W., Fyfe, C.: Online Clustering Algorithms. Int’l J. Neural Systems 18(3), 185–194 (2008); Levenshtein, V.I.: Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Physics Doklady 10, 707–710 (1966)Google Scholar
  5. 5.
    Sahami, M., Heilman, T.D.: A Web-based Kernel Function for Measuring the Similarity of Short Text Snippets. In: Proc. the 15th Int’l Conf. World Wide Web (WWW 2006), pp. 377–386 (2006)Google Scholar
  6. 6.
    Chang, J.H., Lee, W.S., Zhou, A.: Finding Recent Frequent Itemsets Adaptively over Online Data Streams. In: ACM SIGKDD Int’l Conf. on Knowledge Discovery and Data Mining (August 2003)Google Scholar
  7. 7.
    Charikar, M., Chen, K., Farach-Colton, M.: Finding Frequent Items in Data Streams. Theoretical Computer Science (January 2004)Google Scholar
  8. 8.
    Dora Cai, Y., Pape, G., Han, J., Welge, M., Auvil, L.: MAIDS: Mining Alarming Incidents from Data Streams. In: Int’l Conf. on Management of Data (June 2004)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Department of Computer ScienceAnil Neerukonda Institute of Technology and SciencesVisakhapatnamIndia

Personalised recommendations