NODE CLASSIFICATION IN GRAPH DATA USING AUGMENTED RANDOM WALK

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

RAHMANI HOSSEIN; Weiss Gerhard

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON WEB RESEARCH
Year:2015 | Issue:1

Download Full-Text

View:

281

Download:

135

Information Seminar Paper

Title

NODE CLASSIFICATION IN GRAPH DATA USING AUGMENTED RANDOM WALK

Author(s)

RAHMANI HOSSEIN | Weiss Gerhard | Issue Writer Certificate

Keywords

TERMS—NODE CLASSIFICATION

MAJORITY RULE

GRAPH AUGMENTATION

RANDOM WALK

Abstract

NODE CLASSIFICATION IN GRAPH DATA PLAYS AN IMPORTANT ROLE IN WEB MINING APPLICATIONS. WE CLASSIFY THE EXISTING NODE CLASSIFIERS INTO INDUCTIVE AND TRANSDUCTIVE APPROACHES. AMONG THE TRANSDUCTIVE METHODS, THE MAJORITY RULE METHOD (MRM) HAS A PROMINENT ROLE. THIS METHOD CONSIDERS ONLY THE CLASS LABELS OF THE NEIGHBORING NODES, NEGLECTING THE INFORMATIVE CONNECTIVITY INFORMATION IN THE GRAPH DATA. IN THIS PAPER, WE PROPOSE AN AUGMENTED RANDOM WALK (ARW) BASED APPROACH TO RESOLVE MAIN LIMITATIONS OF MRM. IN OUR PROPOSED METHOD, FIRST, WE AUGMENT THE INITIAL GRAPH BY ADDING CLASS LABELS AS NEW NODES TO THE GRAPH AND THEN WE CONNECT EACH CLASSIFIED NODE TO ITS CORRESPONDING CLASS LABEL NODES. SECOND, WE APPLY A RANDOM WALK ALGORITHM TO FIND THE SIMILARITY SCORE OF EACH UN-CLASSIFIED NODE TO DIFFERENT CLASS LABELS. THIRD, WE PREDICT CLASS LABELS WITH THE HIGHEST SCORES FOR THE UN-CLASSIFIED NODE. EMPIRICAL RESULTS SHOW THAT OUR PROPOSED METHOD CLEARLY OUTPERFORMS THE MAJORITY RULE METHOD IN SIX GRAPH DATASETS WITH HIGH HOMOPHILY.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

RAHMANI, HOSSEIN, & Weiss, Gerhard. (2015). NODE CLASSIFICATION IN GRAPH DATA USING AUGMENTED RANDOM WALK. INTERNATIONAL CONFERENCE ON WEB RESEARCH. SID. https://sid.ir/paper/948790/en

Vancouver: Copy

RAHMANI HOSSEIN, Weiss Gerhard. NODE CLASSIFICATION IN GRAPH DATA USING AUGMENTED RANDOM WALK. 2015. Available from: https://sid.ir/paper/948790/en

IEEE: Copy

HOSSEIN RAHMANI, and Gerhard Weiss, “NODE CLASSIFICATION IN GRAPH DATA USING AUGMENTED RANDOM WALK,” presented at the INTERNATIONAL CONFERENCE ON WEB RESEARCH. 2015, [Online]. Available: https://sid.ir/paper/948790/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops