Skip to main content

Multimedia Data Mining Using P-Trees

  • Conference paper
Book cover Mining Multimedia and Complex Data (PAKDD 2002)

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

Included in the following conference series:

Abstract

Peano count trees (P-trees) provide efficient, lossless, data mining ready representations of tabular data and make possible the mining of multiple very large data sets, including time-sequences of Remotely Sensed Imagery (RSI) and micro-array gene expression datasets (MA). Each MA dataset presents a one-time, gene expression level map of thousands of genes subjected to hundreds of conditions. MA data has traditionally been archived as text abstracts (e.g., Medline abstracts). An important multimedia application is to integrate macro-scale analysis of RSI with the micro-scale analysis of MA across multiple plant organisms. This is truly a multimedia data mining problem. Most multimedia data is mined by extracting pertinent features into tables, then mining the tables. P-trees are a convenient technology to mine all such multimedia data.

Patents are pending on the P-tree technology. This work is partially supported by GSA Grant ACT# K96130308, NSF Grant OSR-9553368 and DARPA Grant DAAH04-96-1-0329.

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. Gaede, V., Gunther, O.: Multidimensional Access Methods Computing Surveys (1998)

    Google Scholar 

  2. Samet, H.: Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading (1990)

    Google Scholar 

  3. Finkel, R.A., Bentley, J.L.: Quad trees: A data structure for retrieval of composite keys. Acta Informatica 4(1) (1974)

    Google Scholar 

  4. HH-codes, available at http://www.statkart.no/nlhdb/iveher/hhtext.html

  5. Perrizo, W., Ding, Q., Ding, Q., Roy, A.: Deriving High Confidence Rules from Spatial Data using Peano Count Trees. In: Wang, X.S., Yu, G., Lu, H. (eds.) WAIM 2001. LNCS, vol. 2118, p. 91. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Doerre, J., Gerstl, P., Seiffert, R.: Text Mining: Finding Nuggets in Mountains of Textural Data. In: KDD-1999, San Diego, CA, USA (1999)

    Google Scholar 

  7. Sullivan, D.: Need for Text Mining in Bus. Intelligence, DM Review (December 2001)

    Google Scholar 

  8. Zaiane, O.R., Han, J., Li, Z., Chee, S., Chiang, J.: MultiMediaMiner: Prototype for MultiMedia Data mining. In: ACM Conference on Management of Data (June 1998)

    Google Scholar 

  9. Denton, A., Ding, Q., Perrizo, W., Ding, Q.: Efficient Hierarchical Clustering Using P-trees. In: Intl. Conference on Computer Applications in Industry and Engineering, San Diego (November 2002)

    Google Scholar 

  10. Fayyad, U., Piatesky-Shapiro, G., Smyth, P.: The KDD process for extracting useful knowledge from volumes of data. Communications of ACM 39(11) (November 1996)

    Google Scholar 

  11. Baker, W., Evans, A., Jordan, L., Pethe, S.: User Verification System In: Workshop on Programming Languages and Systems, Pace University (April 19, 2002)

    Google Scholar 

  12. Djeraba, C., Briand, H.: Temporal and Interactive Relations in a Multimedia Database System. In: Morganti, M., Fdida, S. (eds.) ECMAST 1997. LNCS, vol. 1242. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  13. Simoff, S.J., Zaïane, O.R.: Multimedia data mining. In: KDD 2000 (2000)

    Google Scholar 

  14. Zaïane, O.R., Han, J., Li, Z.-N., Hou, J.: Mining Multimedia Data. In: CASCON 1998: Meeting of Minds (1998)

    Google Scholar 

  15. Ding, Q., Ding, Q., Perrizo, W.: Decision Tree Classification of Spatial Data Streams Using P-trees. In: ACM Symposium Applied Computing, Madrid (March 2002)

    Google Scholar 

  16. Ding, Q., Ding, Q., Perrizo, W.: Association Rule Mining on RSI Using P-trees. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol. 2336, p. 66. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  17. Hossain, M.: Bayesian Classification using P-Tree, Master of Science Thesis, North Dakota State University (December 2001)

    Google Scholar 

  18. Khan, M., Ding, Q., Perrizo, W.: K-nearest Neighbor Classification on Spatial Data Streams Using P-trees. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol. 2336, p. 517. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  19. Valdivia-Granda, W., Perrizo, W., Larson, F., Deckard, E.: P-trees and ARM for gene expression profiling of DNA microarrays. In: Intl. Conference on Bioinformatics (2002)

    Google Scholar 

  20. Perera, A.S., Serazi, M.H., Perrizo, W.: Performance Improvement for Bayesian Classification with P-Trees. In: Computer Applications in Industry and Engineering, San Diego (November 2002)

    Google Scholar 

  21. Perera, A., Denton, A., Kotala, P., Jockheck, W., Valdivia-Granda, W., Perrizo, W.: P-tree Classification of Yeast Gene Deletions. In: SIGKDD Explorations (January 2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Perrizo, W., Jockheck, W., Perera, A., Ren, D., Wu, W., Zhang, Y. (2003). Multimedia Data Mining Using P-Trees. In: Zaïane, O.R., Simoff, S.J., Djeraba, C. (eds) Mining Multimedia and Complex Data. PAKDD 2002. Lecture Notes in Computer Science(), vol 2797. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39666-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39666-6_7

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39666-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics