Skip to main content
SpringerLink
Log in

A New Method of Clustering Search Results Using Frequent Itemsets with Graph Structures

  • Conference paper
  • First Online:
IT Convergence and Services

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 107))

  • 1029 Accesses

Abstract

The representation of search results from the World Wide Web has received considerable attention in the database research community. Systems have been proposed for clustering search results into meaningful semantic categories for presentation to the end user. This paper presents a novel clustering algorithm, which is based on the concept of frequent itemsets mining over a graph structure, to efficiently generate search result clusters. The performance study reveals that the algorithm was highly efficient and significantly outperformed previous approaches in clustering search results.

This work is supported by National Science Council of Taiwan (R.O.C.) under Grants NSC99-2218-E-268-001, NSC99-2221-E-006-133, and NSC100-2221-E-309-011.

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

Access this chapter

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Notes

  1. 1.

    http://www.dmoz.org

  2. 2.

    http://dir.yahoo.com

  3. 3.

    http://www.google.com

References

  1. Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: VLDB, pp 487–499

    Google Scholar 

  2. Bernardini A, Carpineto C, D’Amico M (2009) Full-subtopic retrieval with keyphrase-based search results clustering. In: Web intelligence, pp 206–213

    Google Scholar 

  3. Carpineto C, Osinski S, Romano G, Weiss D (2009) A survey of web clustering engines. ACM Comput Surv 41(3):1–38

    Article  Google Scholar 

  4. Carpineto C, Romano G (2010) Optimal meta search results clustering. In: SIGIR, pp 170–177

    Google Scholar 

  5. Giacomo ED, Didimo W, Grilli L, Liotta G (2007) Graph visualization techniques for web clustering engines. IEEE Trans Vis Comput Graph 13(2):294–304

    Article  Google Scholar 

  6. Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In Proceedings of the 2000 ACM SIGMOD international conference on Management of data, pp 1–12 ACM

    Google Scholar 

  7. Manning CD, Raghavan P, Schtze H (2008) Introduction to information retrieval. Cambridge University Press, New York

    Book  MATH  Google Scholar 

  8. Osinski S, Stefanowski J, Weiss D (2004) Lingo: search results clustering algorithm based on singular value decomposition. In: Intelligent information systems, pp 359–368

    Google Scholar 

  9. Rijsbergen CV (1979) Information retrieval. Butterworth-Heinemann, Newton

    Google Scholar 

  10. Zaki MJ (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3):372–390

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Management, Fotech, 831, Kaohsiung, Taiwan

    I-Fang Su

  2. Department of CSIE, CJCU, 711, Tainan, Taiwan

    Yu-Chi Chung

  3. Department of CSIE, NCKU, 701, Tainan, Taiwan

    Chiang Lee & Xuanyou Lin

Authors
  1. I-Fang Su
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yu-Chi Chung
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chiang Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xuanyou Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I-Fang Su .

Editor information

Editors and Affiliations

  1. SeoulTech, Computer Science and Engineering, Seoul University of Science & Technology, Gongreung 2-dong 172, Seoul, 139-743, Korea, Republic of (South Korea)

    James J. Park

  2. , Computer Science, University of Georgia, GSRC 415, Athens, 30602-7404, Georgia, USA

    Hamid Arabnia

  3. , Business Administration, Daejin University, Hogukro 1007, Pocheon-Si, 487-711, Kyonggi-do, Korea, Republic of (South Korea)

    Hang-Bae Chang

  4. , Division of Information and Computer Eng, Ajou University, San 5, Suwon, Gyeonggido, 443-749, Korea, Republic of (South Korea)

    Taeshik Shon

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media B.V.

About this paper

Cite this paper

Su, IF., Chung, YC., Lee, C., Lin, X. (2011). A New Method of Clustering Search Results Using Frequent Itemsets with Graph Structures. In: Park, J., Arabnia, H., Chang, HB., Shon, T. (eds) IT Convergence and Services. Lecture Notes in Electrical Engineering, vol 107. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-2598-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-94-007-2598-0_9

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-007-2597-3

  • Online ISBN: 978-94-007-2598-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation