Skip to main content

Research of Incremental Dimensionality Reduction Based on Tensor Decomposition Algorithm

  • Conference paper
  • First Online:
  • 1581 Accesses

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

Abstract

For mass or temporal data, it is too large and even impossible for the calculated amount of dimension reduction all at once. Based on text feature graph clusters, first, each text feature graph serves as a second-order tensor. Then, two or more text feature graphs were made up to form a third-order tensor. Moreover, tensor Tucker decomposition is used to study the incremental dimensionality reduction methods of text feature graphs. Finally, experiments on real data sets show that this method is simple and effective for dimensionality reduction of text feature graphs.

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

Buying options

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 EPUB and 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
Hardcover Book
USD   329.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

Learn about institutional subscriptions

References

  1. Deerwester, S.C., Dumais, S.T., Landauer, T.K., et al.: Indexing by latent semantic analysis. J. Am. Soc. Inform. Sci. 41(6), 391–407 (1990)

    Article  Google Scholar 

  2. Li, L., Zhang, Y.J.: A survey on algorithms of non-negative matrix factorization. Acta. Electron. Sin. 36(4), 737–743 (2008)

    Google Scholar 

  3. He, H.B., Li, X.F., Zhao, L.L.: Research of text categor ization based on CCIPCA and ICA. Comput. Eng. Appl. 44(29), 150–152 (2008)

    Google Scholar 

  4. Gao, M.T., Wang, Z.O.: Comparing dimension reduction methods of text feature matrix. Comput. Eng. Appl. 42(30), 157–159 (2006)

    Google Scholar 

  5. Zhao, C.W., Sun, S.H., Li, X.P.: Dimension reduction for text expression based on semantic similarity. (Journal of Henan University of Science and Technology). Nat. Sci. 29(5), 36–39 (2008)

    Google Scholar 

  6. Ricci Curbastro, G.: Résumé de quelques travaux sur les systèmes variables de fonctions associés à une forme différentielle quadratique. Bulletin des Sciences Mathématiques, 2(16), 167–189 (1982)

    Google Scholar 

  7. Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM review, 51(3), 455–500 (2009)

    Google Scholar 

Download references

Acknowledgments

This work was supported by the National Natural Science Foundation of China (71171148, 61403238), the National Key Technology R&D Program (2012BAD35B01, 2012BAH13F04) and the National High-Tech Research and Development plan of China (2012AA062203), the National Basic Research Program of China (2014CB340404), and the Natural Science Foundation of Shanxi (2014021022-1).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xin Guo .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer India

About this paper

Cite this paper

Guo, X. et al. (2016). Research of Incremental Dimensionality Reduction Based on Tensor Decomposition Algorithm. In: Zeng, QA. (eds) Wireless Communications, Networking and Applications. Lecture Notes in Electrical Engineering, vol 348. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2580-5_9

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-2580-5_9

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-2579-9

  • Online ISBN: 978-81-322-2580-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics