Skip to main content

A Component Clustering Index Tree Based on Semantic

  • Conference paper
Emerging Research in Web Information Systems and Mining (WISM 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 238))

Included in the following conference series:

  • 884 Accesses

Abstract

The reasonable classification of components is the basis and key of component efficient retrieval. In order to overcome the shortcomings of faceted classification method widely used, we adopt a method combing faceted classification with full-text retrieval to describe components. Based on that description, a component cluster index tree is proposed which uses cluster analysis technique and semantic analysis technique. And the experiments prove that the index tree is feasible, which can effectively overcome the shortcomings of faceted classification method. Meanwhile to some extent, it can achieve the component semantic retrieval and has higher component recall ratio and precision ratio. Moreover, the description of retrieval conditions is no longer limited by restrictive terms so as to be convenient for general users.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Yang, F., Mei, H.: The Component Software Design and Achievement. Tsinghua University Press, Beijing (2008)

    Google Scholar 

  2. Zhong, C., Guo, G., Zhang, Y.: Research on Matching Algorithm for Faceted-based Software Component Query Through Different Component Repositories. Computer Engineering 32(21), 82–84 (2006)

    Google Scholar 

  3. Pan, Y., Zhao, J.F., Xie, B.: The Research and Development of the Technologies in Component Library. Computer Science 5, 90–93 (2003)

    Google Scholar 

  4. Liu, D., Zhao, L., Wang, Z.: A Component Classification Retrieval Method based on the Facet Classification and Clustering Analysis. Component Application 24, 89–90 (2004)

    Google Scholar 

  5. Zhang, Y., Ren, Y., Chen, L., Xie, B.: Component Clustering Algorithm Based on semantic similarity and optimization. Computer Engineering and Design 31(11), 2531–2534 (2010)

    Google Scholar 

  6. Liu, Y., Kuang, Y.: Approximate K-NN Search in High-Dimensional Spaces Based on the Clustering Index Tree. Modern Computer 255, 18–21 (2007)

    Google Scholar 

  7. Liang, J., Feng, Y.: CSA-Tree: An Improved High-Dimensional Index Tree for Main Memory Access. Computer Science 30(3), 415–423 (2007)

    MathSciNet  Google Scholar 

  8. Shanghai Component Library, http://www.sstc.org.cn/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, C., Ren, Y. (2011). A Component Clustering Index Tree Based on Semantic. In: Zhiguo, G., Luo, X., Chen, J., Wang, F.L., Lei, J. (eds) Emerging Research in Web Information Systems and Mining. WISM 2011. Communications in Computer and Information Science, vol 238. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24273-1_48

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24273-1_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24272-4

  • Online ISBN: 978-3-642-24273-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics