Abstract
The dyads relationship as a substantial portion of triads or larger structure formed a ranked clusterability model in social network. Ranked clusterability model of dyads postulates that the hierarchical clustering process starts from the mutual dyads which occur only within clusters then stop until all of the mutual dyads grouped. The hierarchy process continues to cluster the asymmetric dyads which occur between clusters but at different levels. Then the last process is clustering the null dyads, which is clustered at the end of the hierarchy after all of asymmetric dyads grouped and occur only between clusters at the same level of the hierarchy. This paper explores a ranked clusterability model of dyads from a simple example of social network and represents it to the new sociomatrix that facilitate to view a whole network and presents the result in a dendrogram network data. This model adds a new insight to the development of science in a clustering study of emerging social network.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)
Davis, J.A., Leinhardt, S.: The Structure of Positive Interpersonal Relations in Small Groups. In: Berger, J., Zelditch, M., Anderson, B. (eds.) Sociological Theories in Progress, vol. 2, Houghton-Mifflin, Boston (1971)
Holland, P.W., Leinhardt, S.: Local Structure in Social Networks. Sociological Methodology 7, 1–45 (1976)
Faust, K.: Very local structure in social networks. Sociological Methodology 37(1), 209–256 (2007)
Hanneman, R.A., Riddle, M.: Introduction to Social Network Methods. University of California, Riverside (2005)
DeCoster, J.: Using ANOVA to Examine Data from Groups and Dyads (2002), http://www.stat-help.com/notes.html (retrieved from the web January 14, 2011)
Kenny, D.A., Kashy, D.A., Cook, W.L.: Dyadic Data Analysis. Guilford Publications, New York (2006)
Yablonsky, L.: The Sociometry of the Dyad. Sociometry 18(4), 357–360 (1955)
Aurifeille, J.-M., Christopher, J.M.: A Dyadic Segmentation Approach toBusiness Partnerships. European Journal of Economic and Social Systems 15(2), 3–16 (2001)
Menon, A.K., Charles, E.: Predicting labels for dyadic data. Data Mining and Knowledge Discovery 21, 327–343 (2010)
Mizruchi, M.S., And Marquis, C.: Egocentric, sociocentric, or dyadic? Identifying the appropriate level of analysis in the study of organizational networks. Social Networks 28(3), 187–208 (2006)
Borgatti, S.P.: Centrality and Network Flow. Social Networks 27, 55–71 (2005)
Katz, L.: A New Status Index Derived From Sociometric Analysis. Psychometrika 18(1) (1953)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hakim, R.B.F., Subanar, Winarko, E. (2011). Ranked Clusterability Model of Dyadic Data in Social Network. In: Park, J.J., Yang, L.T., Lee, C. (eds) Future Information Technology. Communications in Computer and Information Science, vol 185. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22309-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-22309-9_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22308-2
Online ISBN: 978-3-642-22309-9
eBook Packages: Computer ScienceComputer Science (R0)