Skip to main content
SpringerLink
Log in

Semi-Discrete Decomposition

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Social Network Analysis and Mining

  • 23 Accesses

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 549.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

Institutional subscriptions

References

  • Berry MW, Browne M (2005) Understanding search engines: mathematical modeling and text retrieval. SIAM, Philadelphia

    Book  MATH  Google Scholar 

  • Berry MW, Drmac Z, Jessup ER (1999) Matrices, vector spaces and information retrieval. SIAM Rev 41(2):335–362

    Article  MathSciNet  MATH  Google Scholar 

  • Cunningham P (2007) Dimension reduction. Technical report UCD-CSI-2007-7, School of computer science and informatics, University College, Dublin

    Google Scholar 

  • Deerwester S, Dumais S, Furnas G, Landauer T, Harshman R (1990) Indexing by latent semantic analysis. J Am Soc Inf Sci 41(6):391–407

    Article  Google Scholar 

  • Divya R, Kumar CA, Saijanani S, Priyadharshini M (2011) Deceiving communication links on an organization email corpus. Malays J Comput Sci 24(1):17–33

    Google Scholar 

  • Dobsa J, Praus P, Kumar CA, Praks P (2012) Classification of hydrochemical data in reduced dimensional space. J Inf Org Sci 36(1):27–37

    Google Scholar 

  • Elden L (2006) Numerical linear algebra in data mining. Acta Numer 15:327–384

    Article  MathSciNet  MATH  Google Scholar 

  • Elden L (2007) Matrix methods in data mining and pattern recognition. SIAM, Philadelphia

    Book  MATH  Google Scholar 

  • Fodor IK (2002) A survey of dimension reduction techniques. Technical report UCRL-148494, University of California

    Google Scholar 

  • Keila PS, Skillicorn DB (2005) Structure in the Enron email dataset. J Comput Math Organ Theory 11(3):183–199

    Article  MATH  Google Scholar 

  • Knight GS, Carosielli L (2003) Detecting malicious use with unlabelled data using clustering and outlier analysis. In: Proceedings of 18th IFIP international conference on information security, Athens, pp 205–216

    Google Scholar 

  • Kolda TG, O’Leary DP (1998) A semi-discrete matrix decomposition for latent semantic indexing in information retrieval. ACM Trans Inf Syst 16(4):322–346

    Article  Google Scholar 

  • Kolda TG, O’Leary DP (2000) Computation and uses of the semidiscrete matrix decomposition. ACM Trans Math Softw 26(3):415–435

    Article  Google Scholar 

  • Kumar CA (2009) Analysis of unsupervised dimensionality reduction techniques. Comput Sci Inf Syst 6(2):217–227

    Article  Google Scholar 

  • Kumar CA (2011) Reducing data dimensionality using random projections and fuzzy k-means clustering. Int J Intell Comput Cybern 4(3):353–365

    Article  MathSciNet  Google Scholar 

  • Kumar CA, Palanisamy R (2010) Comparison of matrix dimensionality reduction methods in uncovering latent structures in the data. J Inf Knowl Manag 9(1):81–92

    Article  Google Scholar 

  • Kumar CA, Srinivas S (2006) Latent semantic indexing using eigenvalue analysis for efficient information retrieval. Int J Appl Math Comput Sci 16(4):551–558

    MATH  Google Scholar 

  • Kumar CA, Srinivas S (2010) A note on weighted fuzzy k-means clustering for concept decomposition. Cybern Syst 41:455–467

    Article  MATH  Google Scholar 

  • McConnell S, Skillicorn DB (2002) Semidiscrete decomposition: a bump hunting technique. In: Proceedings of the Australian data mining workshop, Canberra, pp 75–82

    Google Scholar 

  • Miettinen P (2009) Matrix decomposition methods for data mining: computational complexity and algorithms. Academic dissertation A-2009-04, Department of Computer Science, University of Helsinki, Finland

    Google Scholar 

  • O’Leary D, Peleg S (1983) Digital image compression by outer product expansion. IEEE Trans Commun 31:441–444

    Article  Google Scholar 

  • Park H, Elden L (2003) Matrix rank reduction for data analysis and feature extraction. Technical report TR 03–015, University of Minnesota

    Google Scholar 

  • Pilato G, Vassallo G, Gaglio S (2005) Wordnet and semi-discrete decomposition for sub-symbolic representation of words. In: Apolloni B et al (eds) Biological and artificial intelligence environments. Springer, Dordrecht, pp 191–198

    Chapter  Google Scholar 

  • Qiang W, XiaoLong L, Yi G (2004) A study of semidiscrete matrix decomposition for LSI in automated text categorization. In: Proceedings of 1st International joint conference on natural language processing. Springer, Berlin/Heidelberg, pp 606–615

    Google Scholar 

  • Skillicorn DB (2004) Applying matrix decompositions to counterterrorism. Technical report, Queen’s University, Kingston

    Google Scholar 

  • Skillicorn DB (2007) Understanding complex datasets data mining with matrix decompositions. Chapman & Hall/CRC, New York

    Book  MATH  Google Scholar 

  • Skillicorn DB, McConnell SM, Soong EY (2003) Handbook of data mining using matrix decompositions. School of Computing, Queen’s University, Kingston

    Google Scholar 

  • Snasel V, Moravec P, Pokorny J (2008) Using semi-discrete decomposition for topic identification. In: 8th International conference on intelligent systems design and applications, Kaohsiung, pp 415–420

    Google Scholar 

  • Snasel V, Horak Z, Abraham A (2010) Link suggestions in terrorist networks using semi discrete decomposition. In: 6th International conference on information assurance and security. Atlanta, pp 23–25

    Google Scholar 

  • Zyto S, Grama A, Szpankowski W (2002) Semi-discrete matrix transforms for image and video compression. In: Proceedings of the data compression conference. Snowbird, Utah, p 484

    Google Scholar 

Download references

Acknowledgments

Author sincerely acknowledges the support from National Board of Higher Mathematics, Dept. of Atomic Energy, Govt. of India under the grant 2/48(11)/2010-R&D II/10806.

Author information

Authors and Affiliations

  1. School of Information Technology and Engineering, VIT University, Vellore, India

    Cherukuri Aswani Kumar

Authors
  1. Cherukuri Aswani Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Cherukuri Aswani Kumar .

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, Calgary, AB, Canada

    Reda Alhajj

  2. Department of Computer Science, University of Calgary, Calgary, AB, Canada

    Jon Rokne

Section Editor information

  1. American University of Sharjah, Sharjah, United Arab Emirates

    Suheil Khoury

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Kumar, C.A. (2018). Semi-Discrete Decomposition. In: Alhajj, R., Rokne, J. (eds) Encyclopedia of Social Network Analysis and Mining. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-7131-2_163

Download citation

Publish with us

Policies and ethics

Search

Navigation