Hyperlink Classification via Structured Graph Embedding

Cited 6 time in webofscience Cited 4 time in scopus
  • Hit : 227
  • Download : 0
We formally define a hyperlink classification problem in web search by classifying hyperlinks into three classes based on their roles: navigation, suggestion, and action. Real-world web graph datasets are generated for this task. We approach the hyperlink classification problem from a structured graph embedding perspective, and show that we can solve the problem by modifying the recently proposed knowledge graph embedding techniques. The key idea of our modification is to introduce a relation perturbation while the original knowledge graph embedding models only corrupt entities when generating negative triplets in training. To the best of our knowledge, this is the first study to apply the knowledge graph embedding idea to the hyperlink classification problem. We show that our model significantly outperforms the original knowledge graph embedding models in classifying hyperlinks on web graphs.
Publisher
ASSOC COMPUTING MACHINERY
Issue Date
2019-07
Language
English
Citation

42nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR), pp.1017 - 1020

DOI
10.1145/3331184.3331325
URI
http://hdl.handle.net/10203/275465
Appears in Collection
CS-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 6 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0