Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Haichuan Shang"'
Publikováno v:
IEEE Access, Vol 6, Pp 16035-16045 (2018)
List-only entity linking (EL) is the task of mapping ambiguous mentions in texts to target entities in a group of entity lists. Different from traditional EL task, which leverages rich semantic relatedness in knowledge bases to improve linking accura
Externí odkaz:
https://doaj.org/article/0f5530192de14292b63414afae63c610
Publikováno v:
Applied Sciences, Vol 8, Iss 10, p 1798 (2018)
In this paper, a novel type of interesting subgraph query is proposed: Minimal Unique Induced Subgraph (MUIS) query. Given a (large) graph G and a query vertex (position) q in the graph, can we find an induced subgraph containing q with the minimal n
Externí odkaz:
https://doaj.org/article/d785ac71bc5248baa21c766798ddcd03
Autor:
Haosen Zhan, Shonosuke Ishiwatari, Koji Zettsu, Haichuan Shang, Ryotaro Tsukada, Masashi Toyoda, Kazutoshi Umemoto
Publikováno v:
IEEE BigData
Large events with many attendees cause congestion in the traffic network around the venue. To avoid accidents or delays due to this kind of unexpected congestion, it is important to predict the level of congestion in advance of the event. This study
Autor:
Rage Uday Kiran, Pamalla Veena, Penugonda Ravikumar, Chennupati Saideep, Koji Zettsu, Haichuan Shang, Masashi Toyoda, Masaru Kitsuregawa, P. Krishna Reddy
Publikováno v:
Electronics; Volume 11; Issue 10; Pages: 1523
Periodic pattern mining is an emerging technique for knowledge discovery. Most previous approaches have aimed to find only those patterns that exhibit full (or perfect) periodic behavior in databases. Consequently, the existing approaches miss intere
Publikováno v:
IEEE Access, Vol 6, Pp 16035-16045 (2018)
List-only entity linking (EL) is the task of mapping ambiguous mentions in texts to target entities in a group of entity lists. Different from traditional EL task, which leverages rich semantic relatedness in knowledge bases to improve linking accura
Publikováno v:
Information Sciences. 381:1-19
SimRank is a well-studied similarity measure between two nodes in a network. However, evaluating SimRank of all nodes in a network is not only time-consuming but also not pragmatic, since users are only interested in the most similar pairs in many re
Publikováno v:
Scientific Programming, Vol 2018 (2018)
POI recommendation finds significant importance in various real-life applications, especially when meeting with location-based services, e.g., check-ins social networks. In this paper, we propose to solve POI recommendation through a novel model of d
Publikováno v:
SSDBM
A temporal database is a collection of transactions, ordered by their timestamps. Discovering partial periodic itemsets in temporal databases has numerous applications. However, to the best of our knowledge, no work has considered finding these items
Autor:
Haichuan Shang, Masaru Kitsuregawa
Publikováno v:
Proceedings of the VLDB Endowment. 6:649-660
Finding the skyline in a multi-dimensional space is relevant to a wide range of applications. The skyline operator over a set of d -dimensional points selects the points that are not dominated by any other point on all dimensions. Therefore, it provi
Publikováno v:
Applied Sciences
Volume 8
Issue 10
Applied Sciences, Vol 8, Iss 10, p 1798 (2018)
Volume 8
Issue 10
Applied Sciences, Vol 8, Iss 10, p 1798 (2018)
In this paper, a novel type of interesting subgraph query is proposed: Minimal Unique Induced Subgraph (MUIS) query. Given a (large) graph G and a query vertex (position) q in the graph, can we find an induced subgraph containing q with the minimal n