Skip to main content

Incremental Target Recognition Algorithm Based on Improved Discernibility Matrix

  • Conference paper
Fuzzy Systems and Knowledge Discovery (FSKD 2005)

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

Included in the following conference series:

  • 1510 Accesses

Abstract

An incremental target recognition algorithm based on improved discernibility matrix in rough set theory is presented. Some comparable experiments have been completed in our “Information Fusion System for Communication Interception Information (IFS/CI2)”. The results of experimentation illuminate that the new algorithm is more efficient than the previous algorithm.

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

Access this chapter

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. Bar-Shalom, Y.: Tracking Methods in a Multitarget Environment. IEEE Transactions on Automatic Control 4, 618–626 (1978)

    Article  Google Scholar 

  2. Congfu, X., Yunhe, P.: IFS/CI2: An intelligent fusion system of communication interception information. Chinese Journal of Electronics and Information Technology 10, 1358–1365 (2002)

    Google Scholar 

  3. Pawlak, Z.: Rough set. International Journal of Computer and Information Science 5, 341–356 (1982)

    Article  MathSciNet  Google Scholar 

  4. Yong, L., Congfu, X., Yunhe, P.: A New Approach for Data Fusion: Implement Rough Set Theory in Dynamic Objects Distinguishing and Tracing. In: IEEE International Conference on Systems, Man & Cybernetics, Hague, pp. 3318–3323 (2004)

    Google Scholar 

  5. Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. Fundamenta Informaticae 2, 331–362 (1991)

    Google Scholar 

  6. Shan, N., Ziarko, W.: An incremental learning algorithm for constructing decision rules. In: Kluwer, R.S. (ed.) Rough Sets, Fuzzy Sets and Knowledge Discovery, pp. 326–334. Springer, Heidelberg (1994)

    Google Scholar 

  7. Yong, L., Congfu, X., Xuelan, L., Yunhe, P.: A dynamic incremental rule extracting algorithm based on the improved discernibility matrix. In: The 2003 IEEE International Conference on Information Reuse and Integration, USA, pp. 93–97 (2003)

    Google Scholar 

  8. Qing, L., Zhaohua, H., Liwen, Y.: Rough Set Theory: Present State and Prospects. Chinese Journal of Computer Science 4, 1–5 (1997)

    Google Scholar 

  9. Qing, L., Zhaohua, H., Shaohui, L., Liwen, Y.: Decision Rules with Rough Operator and Soft Computing of Data Mining. Chinese Jounal of Computer Research and Development 7, 800–804 (1999)

    Google Scholar 

  10. Agrawal, R., Srikant, S.: Fast Algorithms for Mining Association Rules in Large Databases. In: VLDB 1994, pp. 487–499. Morgan Kaufmann, San Francisco (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yong, L., Congfu, X., Zhiyong, Y., Yunhe, P. (2005). Incremental Target Recognition Algorithm Based on Improved Discernibility Matrix. In: Wang, L., Jin, Y. (eds) Fuzzy Systems and Knowledge Discovery. FSKD 2005. Lecture Notes in Computer Science(), vol 3613. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539506_156

Download citation

  • DOI: https://doi.org/10.1007/11539506_156

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28312-6

  • Online ISBN: 978-3-540-31830-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics