skip to main content
10.1145/1988688.1988746acmotherconferencesArticle/Chapter ViewAbstractPublication PageswimsConference Proceedingsconference-collections
research-article

Mining social networks and their visual semantics from social photos

Published: 25 May 2011 Publication History

Abstract

With the new possibilities in communication and information management, social networks and photos have received plenty of attention in the digital age. But there has been little research about the possibility that social photos carry some implicit social information and about the capacity to use this information for mining social data. In this paper, we show how social photos, captured during family or friends' events, representing individuals or groups, can be used to build social networks and express part of their semantics. Our contribution takes a wedding as an example. We present a method with different facets which give different results. The resulting social networks can be used by people as a mirror of the event and also as a means for sharing photos with personalized albums.

References

[1]
G. Battista, P. Eadeaus, R. Tamassia, and I. Tollis. Graph drawing. algorithms for the visualisation of graphs. Prentice Hall, 1999.
[2]
Berge, C. Graphs and Hypergraphs. New York: Elsevier. 1973.
[3]
J. Bu, S. Tan, C. Chen, C. Wang, H. Wu, L. Zhang, and X. He. Music recommendation by unified hypergraph: Combining social media information and music content. Proceedings of the ACM international conference on Multimedia, Firenze, Italy, October 2010.
[4]
M. Crampes, S. Ranwez, J. Villerd, F. Velickovski, C. Mooney, A. Emery, and N. Mille. Concept maps for designing adaptive knowledge maps. Information Visualization, Palgrave, pages 5:211--224, 2006
[5]
P. Eades. A heuristic for graph drawing. Congressus Numerantium, pages 42:149--160, 1984.
[6]
L. C. Freeman. A set of measures of centrality based on betweenness. Sociometry, pages 40/1:35--41, 2009.
[7]
B. Ganter and R. Wille. Formal concept analysis. Mathematical Foundations, Springer, 1999
[8]
Goldberg, A. V. Finding a maximum density subgraph. Tech. rep. 1984.
[9]
S. A. Golder. Measuring social networks with digital photograph collections. Hypertext and Hypermedia ACM Conference. June 19--21. Pittsburgh, Pennsylvania, 2008.
[10]
R. Jain. Life = experiences(events) and vision. Proceedings of the ACM international conference on Multimedia, Firenze, Italy, October 2010.
[11]
T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, page 31(1):7(15), 1989.
[12]
L. Kaufman, P. Rousseuw, and J. B. P. Finding groups in data: An introduction to cluster analysis. WILEY Interscience, 1990.
[13]
D. Koschützki, K. A. Lehmann, L. Peeters, S. Richter, D. Tenfelde-Podehl, and O. Zlotowski. Centrality indices. Brandes, U. and Erlebach, T. (Eds.) Network Analysis: Methodological Foundations, LNCS 3418, Springer-Verlag, pages 16--61, 2005.
[14]
Samir Khuller, Barna Saha, On Finding Dense Subgraphs, Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I, July 05--12, 2009, Rhodes, Greece
[15]
P. Mika. Ontologies are us: A unified model of social networks and semantics. In International Semantic Web Conference, pages 522--536, 2005.
[16]
M. Plantié and M. Crampes. From photo networks to social networks, creation and use of a social network derived with photos. ACM Multimedia International Conference, Firenze, Italy, October, 2010.
[17]
L. J. Strahilevitz. A social networks theory of privacy. American Law & Economics, Association Annual Meetings, 2005.
[18]
P. Wu and D. Tretter. Close & closer: Social cluster and closeness from photo collections. Proceedings of the seventeen ACM international conference on Multimedia, 2009.

Cited By

View all
  • (2012)Clustering-based burst-detection algorithm for web-image document stream on social media2012 IEEE International Conference on Systems, Man, and Cybernetics (SMC)10.1109/ICSMC.2012.6377809(703-708)Online publication date: Oct-2012

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
WIMS '11: Proceedings of the International Conference on Web Intelligence, Mining and Semantics
May 2011
563 pages
ISBN:9781450301480
DOI:10.1145/1988688
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 May 2011

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Galois latice
  2. formal concept analysis
  3. graph theory
  4. hypergraphs
  5. social networks
  6. social photos
  7. social tribe

Qualifiers

  • Research-article

Conference

WIMS '11

Acceptance Rates

Overall Acceptance Rate 140 of 278 submissions, 50%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 20 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2012)Clustering-based burst-detection algorithm for web-image document stream on social media2012 IEEE International Conference on Systems, Man, and Cybernetics (SMC)10.1109/ICSMC.2012.6377809(703-708)Online publication date: Oct-2012

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media