9 citations · 17 across the 3 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2012
Mining Preserving Structures in a Graph Sequence
Takeaki Uno, Yushi Uno
In the recent research of data mining, frequent structures in a sequence of graphs have been studied intensively, and one of the main concern is changing structures along a sequenc…
cs.DS2011★ 7 cited
Efficient Algorithms for Dualizing Large-Scale Hypergraphs
Keisuke Murakami, Takeaki Uno
A hypergraph is a set family defined on vertex set . The dual of is the set of minimal subsets of such that for any $F\in {…
cs.DS2009★ 9 cited
Efficient Construction of Neighborhood Graphs by the Multiple Sorting Method
Takeaki Uno, Masashi Sugiyama, Koji Tsuda
Neighborhood graphs are gaining popularity as a concise data representation in machine learning. However, naive graph construction by pairwise distance calculation takes r…