#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2012

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Mitsuru Kusumoto, Takanori Maehara, Ken-ichi Kawarabayashi
- SIGMOD Conference
- 2014

SimRank, proposed by Jeh and Widom, provides a good similarity score and has been successfully used in many of the above mentioned applications. While there are many algorithms proposed so far to compute SimRank, but unfortunately, none of them are scalable up to graphs of billions size. Motivated by this fact, we consider the following SimRank-based… (More)

SimRank, proposed by Jeh and Widom, provides a good similarity measure that has been successfully used in numerous applications. While there are many algorithms proposed for computing SimRank, their computational costs are very high. In this paper, we propose a new computational technique, " SimRank lineariza-tion, " for computing SimRank, which converts… (More)

- Mitsuru Kusumoto, Yuichi Yoshida
- ICALP
- 2014

We consider the problem of testing if two input forests are isomorphic or are far from being so. An algorithm is called an ε-tester for forest-isomorphism if given an oracle access to two forests G and H in the adjacency list model, with high probability, accepts if G and H are isomorphic and rejects if we must modify at least εn edges to make G isomorphic… (More)

- Takanori Maehara, Mitsuru Kusumoto, Ken-ichi Kawarabayashi
- 2015 IEEE 31st International Conference on Data…
- 2015

Similarity join finds all pairs of objects (i, j) with similarity score s(i, j) greater than some specified threshold θ. This is a fundamental query problem in the database research community, and is used in many practical applications, such as duplicate detection, merge/purge, record linkage, object matching, and reference conciliation. In this… (More)

The ability to recognize analogies is an important factor that is closely related to human intelligence. Verbal analogies have been used for evaluating both examinees at university entrance exams as well as algorithms for measuring relational similarity. However, relational similarity measures proposed so far are confined to measuring the similarity between… (More)

- Mitsuru Kusumoto, Yuichi Yoshida, Hiro Ito
- 2012 Third International Conference on Networking…
- 2012

We propose constant-time algorithms for approximating the weight of the maximum weight branching in the general graph model. A directed graph is called a branching if it is acyclic and each vertex has at most one incoming edge. An edge-weighted digraph G, in which weights are given in real values in [0, 1], of average degree d is given as an oracle access,… (More)

- ‹
- 1
- ›