Research ArticleOpen AccessGoogle Scholar indexed
Aggregating Edge Weights in Social Networks on the Web Extracted from Multiple Sources with Different Importance Degrees
Institute of Information Technology, Azerbaijan National Academy of Sciences, Baku, Azerbaijan.
Institute of Information Technology, Azerbaijan National Academy of Sciences, Baku, Azerbaijan
Institute of Information Technology, Azerbaijan National Academy of Sciences, Baku, Azerbaijan.
- 1 Institute of Information Technology, Azerbaijan National Academy of Sciences, Baku, Azerbaijan.
- 2 Institute of Information Technology, Azerbaijan National Academy of Sciences, Baku, Azerbaijan
- 3 Institute of Information Technology, Azerbaijan National Academy of Sciences, Baku, Azerbaijan.
Journal of Intelligent Learning Systems and Applications·Volume 04 (2012)·Pages 154–158·Published 23 May 2012·DOI10.4236/jilsa.2012.42015
Copy link · social · email
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.
KeywordsOWA OperatorOrnessData Source
- H. Kautz, B. Selman and M. Shah, “The Hidden Web,” AI Magazine, Vol. 18, No. 2, 1997, pp. 27-36.
- 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
- 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.
- 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.
- 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
- 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
- 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.
- 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
- 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.
- 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
- 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.