Skip to main content

Hierarchical Document Clustering Using Frequent Closed Sets

  • Conference paper
Intelligent Information Processing and Web Mining

Part of the book series: Advances in Soft Computing ((AINSC,volume 35))

Abstract

Aerial archaeology plays an important role in the detection and documentation of archaeological sites, which often cannot be easily seen from the ground. It is a quick way to survey large areas, but requires a lot of error-prone human work to analyze it afterwards. In this paper we utilize some of the best-performing image processing and data mining methods to develop a system capable of an accurate automated classification of such aerial photographs. The system consists of phases of image indexing, rough image segmentation, feature extraction, feature grouping and building the classifier. We present the results of experiments conducted on a real set of archaeological and non-archaeological aerial photographs and conclude with perspectives for future work.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. 1. Agrawal R., Srikant R.: Fast Algorithms for Mining Association Rules, VLDB, Santiago, Chile, Morgan Kaufmann, 1994, 487–499

    Google Scholar 

  2. 2. Beil F., Ester M., Xu X.: Frequent term-based text clustering. KDD 2002: 436–442

    Google Scholar 

  3. 3. Fung B.C.M., Wan K., Ester M.: Hierarchical Document Clustering Using Frequent Itemsets, SDM'03, 2003

    Google Scholar 

  4. 4. Ganter B., Wille R.: Formal Concept Analysis, Mathematical Foundations, Springer, 1999

    Google Scholar 

  5. 5. Pasquier N., Bastide Y., Taouil R., Lakhal L.: Discovering Frequent Closed Itemsets for Association Rules, LNCS, Vol. 1540. Springer, 1999, 398–416

    Google Scholar 

  6. 6. Steinbach M., Karypis G., Kumar V.: A comparison of Document Clustering Techniques, KDD Workshop on Text Mining, 2000

    Google Scholar 

  7. 7. Xu X., Ester M., Kriegel H.P., Sander J.: A Distribution-Based Clustering Algorithm for Mining in Large Spatial Databases. In: Proc. of the 14th ICDE Conference (1998)

    Google Scholar 

  8. 8. Wang K., Xu C., Liu B.: Clustering Transactions Using Large Items, CIKM, 1999, 483–490

    Google Scholar 

  9. 9. http://fimi.cs.helsinki.fi

    Google Scholar 

  10. 10. http://www-users.cs.umn.edu/~karypis/cluto

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer

About this paper

Cite this paper

Kryszkiewicz, M., Skonieczny, Ɓ. (2006). Hierarchical Document Clustering Using Frequent Closed Sets. In: KƂopotek, M.A., WierzchoƄ, S.T., Trojanowski, K. (eds) Intelligent Information Processing and Web Mining. Advances in Soft Computing, vol 35. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-33521-8_53

Download citation

  • DOI: https://doi.org/10.1007/3-540-33521-8_53

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33520-7

  • Online ISBN: 978-3-540-33521-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics