Skip to main content
SpringerLink
Log in
Book cover

Pacific-Asia Conference on Knowledge Discovery and Data Mining

PAKDD 1998: Research and Development in Knowledge Discovery and Data Mining pp 394–396Cite as

A data mining approach for query refinement

  • Posters
  • Conference paper
  • First Online:

  • 1656 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1394))

Abstract

We propose a data mining approach for query refinement using Association Rules (ARs) among keywords being extracted from a document database. We are concerned with two issues in this paper. First, instead of using minimum support and minimum confidence which has little effectiveness of screening documents, we use maximum support and maximum confidence. Second, to further reduce the number of rules, we introduce two co-related concepts: “stem rule” and “coverage” The effectiveness of using ARs to screen is reported as well.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Agrawal R., Imielinski T., Swami A.: Mining Association Rules between Sets of Items in Large Databases. ACM SIGMOD'93, 207–216.

    Google Scholar 

  2. Chen H., Liu Y., Ohbo N.: Keyword Document Retrieval by Data Mining. IPSJ SIG-NOTES 97(64) (1997); 227–232. (in Japanese)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electronic & Information Science, University of Tsukuba, 305, Tsukuba, Japan

    Ye Liu & Nobuo Ohbo

  2. Tsukuba International University, Manabe 6, 300, Tsuchiura, Japan

    Hanxiong Chen

  3. Department of Computer Science, Australian National University, 0200, Canberra, ACT, Australia

    Jeffrey Xu Yu

Authors
  1. Ye Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hanxiong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jeffrey Xu Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Nobuo Ohbo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science and Software Engineering, Monash university, 900 Dandenong Road, Caulfield East, Victoria, 3145, Australia

    Xindong Wu

  2. Department of Computer Science, The University of Melbourne, Parkville, Victoria, 3052, Australia

    Ramamohanarao Kotagiri

  3. School of Computer Science and Engineering, Monash university, Clayton, Victoria, 3168, Australia

    Kevin B. Korb

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, Y., Chen, H., Xu Yu, J., Ohbo, N. (1998). A data mining approach for query refinement. In: Wu, X., Kotagiri, R., Korb, K.B. (eds) Research and Development in Knowledge Discovery and Data Mining. PAKDD 1998. Lecture Notes in Computer Science, vol 1394. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64383-4_40

Download citation

  • DOI: https://doi.org/10.1007/3-540-64383-4_40

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64383-8

  • Online ISBN: 978-3-540-69768-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation