Sumio Fujita

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Vibhor Kanojia

> Home > Persons > Sumio Fujita

Publications

2018
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/ijdsa/NaikMKF18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijdsa/NaikMKF18
Anup Naik, Hideyuki Maeda, Vibhor Kanojia, Sumio Fujita:
Scalable Twitter user clustering approach boosted by Personalized PageRank. Int. J. Data Sci. Anal. 6(4): 297-309 (2018)
2017
[c25]
- view
  authority control:
- export record
  dblp key:
  - conf/pakdd/NaikMKF17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pakdd/NaikMKF17
Anup Naik, Hideyuki Maeda, Vibhor Kanojia, Sumio Fujita:
Scalable Twitter User Clustering Approach Boosted by Personalized PageRank. PAKDD (1) 2017: 472-485
[c20]
- view
  authority control:
- export record
  dblp key:
  - conf/www/KanojiaMTF17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/www/KanojiaMTF17
Vibhor Kanojia, Hideyuki Maeda, Riku Togashi, Sumio Fujita:
Enhancing Knowledge Graph Embedding with Probabilistic Negative Sampling. WWW (Companion Volume) 2017: 801-802
[c19]
- view
  authority control:
- export record
  dblp key:
  - conf/www/TogashiMKMF17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/www/TogashiMKMF17
Riku Togashi, Hideyuki Maeda, Vibhor Kanojia, Kousuke Morimoto, Sumio Fujita:
Euclidean Image Embedding in view of Similarity Ranking in Auction Search by Image. WWW (Companion Volume) 2017: 847-848

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.