Skip to main content

Complex Interactions in Social and Event Network Analysis

  • Conference paper
  • First Online:
Social Computing, Behavioral-Cultural Modeling, and Prediction (SBP 2015)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9021))

Abstract

Modern social network analytic techniques, such as centrality analysis, outlier detection, and/or segmentation, are limited in that they typically only identify interactions within the dataset occurring as a first-order effect. In our previous work, we illustrated how the use of tensor decomposition can be used to identify multi-way interactions in both sparse and dense data-sets. The primary aim of this paper will be to introduce innovative extensions to our tensor decomposition approach that target and/or identify second and third order effects.

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. Davidson, I.: Knowledge driven dimension reduction for clustering. IJCAI, 1034–1039 (2009)

    Google Scholar 

  2. Davidson, I., Gilpin, S., Walker, P. B.: Behavioral Event Data and Their Analysis. In: Data Mining & Knowledge Discovery, pp. 635–653 (2012)

    Google Scholar 

  3. Hagen, L., Kahng, A.: New spectral methods for ratio cut partitioning and clustering. IEEE Transactions in Computer-Aided Design 11(9), 1074–1085 (1992)

    Article  Google Scholar 

  4. Stoer, M., Wagner, F.: A simple min-cut algorithm. J. ACM 44(4), 585–591 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  5. Von Luxburg, U.: A Tutorial on Spectral Clustering. Statistics and Computing 17 (4) (2007)

    Google Scholar 

  6. Wagner, D., Wagner, F.: Between min cut and graph bisection. In: Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science (MFCS), pp. 744–750). Springer, London (1993)

    Google Scholar 

  7. Wang, X., Davidson, I.: Flexible constrained spectral clustering. In: KDD 2010, pp. 563–572 (2010)

    Google Scholar 

  8. Wu, Z., Leahy, R.: An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 15 (11), 1,101–1,113 (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Peter B. Walker .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Walker, P.B., Fooshee, S.G., Davidson, I. (2015). Complex Interactions in Social and Event Network Analysis. In: Agarwal, N., Xu, K., Osgood, N. (eds) Social Computing, Behavioral-Cultural Modeling, and Prediction. SBP 2015. Lecture Notes in Computer Science(), vol 9021. Springer, Cham. https://doi.org/10.1007/978-3-319-16268-3_56

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-16268-3_56

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-16267-6

  • Online ISBN: 978-3-319-16268-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics