CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Analysis of Implicit Relationships on Wikipedia through Elucidatory Objects

by S. Reddy Mubaraq, P.rajarajeswari, D.vasumathi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 103 - Number 8
Year of Publication: 2014
Authors: S. Reddy Mubaraq, P.rajarajeswari, D.vasumathi
10.5120/18096-9154

S. Reddy Mubaraq, P.rajarajeswari, D.vasumathi . Analysis of Implicit Relationships on Wikipedia through Elucidatory Objects. International Journal of Computer Applications. 103, 8 ( October 2014), 33-35. DOI=10.5120/18096-9154

@article{ 10.5120/18096-9154,
author = { S. Reddy Mubaraq, P.rajarajeswari, D.vasumathi },
title = { Analysis of Implicit Relationships on Wikipedia through Elucidatory Objects },
journal = { International Journal of Computer Applications },
issue_date = { October 2014 },
volume = { 103 },
number = { 8 },
month = { October },
year = { 2014 },
issn = { 0975-8887 },
pages = { 33-35 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume103/number8/18096-9154/ },
doi = { 10.5120/18096-9154 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:34:03.086331+05:30
%A S. Reddy Mubaraq
%A P.rajarajeswari
%A D.vasumathi
%T Analysis of Implicit Relationships on Wikipedia through Elucidatory Objects
%J International Journal of Computer Applications
%@ 0975-8887
%V 103
%N 8
%P 33-35
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Wikipedia is a better option for a client to gain information of particular objects than other search engines. Previously, cohesion-based technique is used for analysis of implicit and explicit relationships between two objects but this technique is inadequate to analyze the relationships because it uses one or two concepts of connectivity, distance and co-citation. We proposed a method for analysis of relationships between objects by using generalized flow based technique which replicates all the concepts. We prove that our process is the most suitable for measuring the strength of relationships between source and destination objects by using elucidatory objects as well as grade the target objects by its strength. Here we quantitatively extract the elucidatory objects.

References
  1. Y. Koren, S. C. North, and C. Volinsky, "Measuring and Extracting Proximity in Networks", Proc. 12th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, pp. 245-255, 2006.
  2. M. Ito, K. Nakayama, T. Hara, and S. Nishio, "Association Thesaurus Construction Methods Based on Link Co-Occurrence Analysis for Wikipedia", Proc. 17th ACM Conf. Information and Knowledge Management (CIKM), pp. 817-826, 2008
  3. J. Gracia and E. Mena, "Web-Based Measure of Semantic Relatedness," Proc. Ninth Int'l Conf. Web Information Systems Eng. (WISE), pp. 136-150, 2008.
  4. K. D. Wayne, "Generalized Maximum Flow Algorithm," PhD dissertation, Cornell Univ. , New York, Jan. 1999.
  5. R. L. Cilibrasi and P. M. B. Vitanyi, "The Google Similarity Distance," IEEE Trans. Knowledge and Data Eng. , vol. 19, no. 3, pp. 370-383, Mar. 2007.
  6. F. M. Suchanek, G. Kasneci, and G. Weikum, "Yago: A Core of Semantic Knowledge," Proc. 16th Int'l Conf. World Wide Web Conf. (WWW), pp. 697-706, 2007.
  7. M. Yazdani and A. Popescu-Belis, "A Random Walk Framework to Compute Textual Semantic Similarity: A Unified Model for Three Benchmark Tasks," Proc. IEEE Fourth Int'l Conf. Semantic Computing (ICSC), pp. 424-429, 2010.
  8. P. Sarkar and A. W. Moore, "A Tractable Approach to Finding Closest Truncated-Commute-Time Neighbors in Large Graphs," Proc. 23rd Conf. Uncertainty in Artificial Intelligence (UAI), 2007
  9. W. Lu, J. Janssen, E. Milios, N. Japkowicz, and Y. Zhang, "Node Similarity in the Citation Graph," Knowledge and Information Systems, vol. 11, no. 1, pp. 105-129, 2006.
  10. H. D. White and B. C. Griffith, "Author Co-citation: A Literature Measure of Intellectual Structure," J. Am. Soc. Information Science and Technology, vol. 32, no. 3, pp. 163-171, May 1981.
  11. "The Erdos Number Project", http:// www. oakland. edu/emp/, 2012
  12. Xinpeng Zhang "A Generalized Flow-Based Method for Analysis of Implicit Relationships on Wikipedia", Dept. of Social Inf. , Kyoto Univ. , Kyoto, Japan; Asano. Y; Yoshikawa. M
Index Terms

Computer Science
Information Sciences

Keywords

Elucidatory objects generalized flow link analysis Wikipedia mining relationships

Powered by PhDFocusTM