Share This Article:

Aggregating Edge Weights in Social Networks on the Web Extracted from Multiple Sources with Different Importance Degrees

Abstract Full-Text HTML Download Download as PDF (Size:199KB) PP. 154-158
DOI: 10.4236/jilsa.2012.42015    3,037 Downloads   5,539 Views   Citations

ABSTRACT

Information on a given set of entities can be derived from multiple sources on the Web. Social networks built from these sources, using these entities as nodes, will have different edge weight values, although the entities will be the same. If these sources are different, one will not normally trust each of them equally. One source will be considered more or less importance than the other. Completely ignoring sources with little importance may yield unexpected results. In this paper, we propose a method for aggregating weight values for social networks built from the Web using different sources. First, multiple social networks are built from different data sources. Then the received edge weights are aggregated, with the importance of a data source taken into account.

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

R. Alguliev, R. Aliguliyev and F. Ganjaliyev, "Aggregating Edge Weights in Social Networks on the Web Extracted from Multiple Sources with Different Importance Degrees," Journal of Intelligent Learning Systems and Applications, Vol. 4 No. 2, 2012, pp. 154-158. doi: 10.4236/jilsa.2012.42015.

References

[1] H. Kautz, B. Selman and M. Shah, “The Hidden Web,” AI Magazine, Vol. 18, No. 2, 1997, pp. 27-36.
[2] Y. Matsuo, J. Mori and M. Hamasaki, “Polyphonet: An Advanced Social Network Extraction System from the Web,” Proceedings of the 15th International Conference on World Wide Web, Edinburgh, 22-26 May 2006, pp. 397-406. doi:10.1145/1135777.1135837
[3] R. Rome, G. Creamer, S. Hershkop and S. Stolfo, “Automated Social Hierarchy Detection through Email Network Analysis,” Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 Workshop on Web Mining and Social Network Analysis, California, 12-15 August, 2007, pp. 109-117.
[4] A. Culotta, R. Bekkerman and A. McCallum, “Extracting Social Networks and Contact Information from Email and the Web,” Proceedings on the 1st Conference on Email and Anti-Spam, California, 30-31 July, 2004.
[5] Q. Li and Y. B. Wu, “People Search: Searching People Sharing Similar Interests from the Web,” Journal of the American Society for Information Science and Technology, Vol. 59, No. 1, 2008, pp. 111-125. doi:10.1002/asi.20736
[6] T. Finin, L. Ding and L. Zou, “Social Networking on the Semantic Web,” The Learning Organization, Vol. 12, No. 5, 2005, pp. 418-435. doi:10.1108/09696470510611384
[7] J. Goldbeck and M. Rothstein, “Linking Social Networks on the Web with FOAF,” Proceedings of the 23rd National Conference on Artificial Intelligence, Chicago, July 13-17, 2008, pp. 1138-1143.
[8] B. Aleman-Meza, M. Nagarajan, C. Ramakrishnan, et al., “Semantic Analytics on Social Networks: Experiences in Addressing the Problem of Conflict of Interest Detection,” Proceedings of the 15th International World Wide Web Conference, Edinburgh, 22-26 May 2006, pp. 407416. doi:10.1145/1135777.1135838
[9] J. Tang, D. Zang and L. Yao, “Social Network Extraction of Academic Researchers,” Proceedings of the 7th IEEE International Conference on Data Mining, Omaha, 28-31 October 2007, pp. 292-301.
[10] R. Alguliev, R. Aliguliyev and F. Ganjaliyev, “Extracting a Heterogeneous Social Network of Academic Researchers on the Web Based on Information Retrieved from Multiple Sources,” American Journal of Operations Research, Vol. 1, No. 2, 2011; pp. 33-38. doi:10.4236/ajor.2011.12005
[11] B. Poliqean, H. Tanev and M. Atkinson, “Extracting and Learning Social Networks out of Multilingual News,” Proceedings of the Social Networks and Application Tools Workshop (SocNet-08), Skalica, 19-21 September 2008, pp. 13-16.
[12] P. Nasirifard, V. Peristeras, C. Hayes and S. Decker, “Extracting and Utilizing Social Networks from Log Files of Shared Workspaces,” 10th IFIP Working Conference on Virtual Enterprises, Thessaloniki, 7-9 October 2009, pp. 643650.
[13] G. Geleijnse and J. Korst, “Creating a Dead Poets Society: Extracting a Social Network of Historical Persons from the Web,” Proceedings of the 6th International and 2nd Asian Conference on Asian Semantic Web Conference, Busan, 11-15 November 2007, pp. 155-168.
[14] T. Nishimura and Y. Matsuo, “A Method of Social Network Extraction via Internet and Networked Sensing,” Proceedings of the 3rd International Conference on Networked Sensing Systems, Chicago, 31 May-2 June 2006, pp. 123-127.
[15] R. Xiang, J. Neville and M. Rogati, “Modeling Relationship Strength in Online Social Networks,” Proceedings of the 19th International World Wide Web Conference, New York, 26-30 April 2010, pp.981-990. doi:10.1145/1772690.1772790
[16] F. Ganjaliyev, “Building a Heterogeneous Social Network of Academic Researchers,” Proceedings of the 3rd International Conference of Problems of Cybernetics and Informatics, Baku, 6-8 September 2010, pp. 179-182.
[17] R. R. Yager, “On Ordered Weighted Averaging Aggregation Operators in Multicriteria Decision Making,” IEEE Transactions on Systems, Man and Cybernetics, Vol. 18, No. 1, 1988, pp. 183-190. doi:10.1109/21.87068
[18] R. Fuller and P. Majlende, “An Analytic Approach for Obtaining Maximal Entropy OWA Operator Weights,” Fuzzy Sets and Systems, Vol. 124, No. 1, 2001, pp. 53-57. doi:10.1016/S0165-0114(01)00007-0

  
comments powered by Disqus

Copyright © 2019 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.