Takeaki Uno

J-GLOBAL         Last updated: Nov 20, 2017 at 14:49
 
Avatar
Name
Takeaki Uno
E-mail
unonii.ac.jp
Affiliation
National Institute of Informatics
Section
Principles of Informatics Research Division
Job title
Professor
Degree
Dr. Science

Profile

My research area is algorithm theory, especially enumeration, data mining, optimization, and graph algorithms. I like to study the improvement of complexities of algorithms and hardness proof of problems, combinatorial structures such as graph classes, on the other hand I like to implement my algorithms especially pattern mining algroithms and data analyzing algorithms efficient for practical large scale data. Recently I'm doint many joint researches with the researches in bioinformatic, Web analysis, data mining, chemo-informatics, machine learning, optimization in real-life, etc.

Research Areas

 
 

Academic & Professional Experience

 
Apr 2014
 - 
Today
教授, 情報・システム研究機構 国立情報学研究所 情報学プリンシプル研究系
 

Awards & Honors

 
Jun 2016
Practical Algorithms for Mining Flock Patterns from Trajectories, IPSJ Best Paper Award, Information Processing Society of Japan
Winner: Xiaoliang Geng, Takeaki Uno, Hiroki Arimura
 
Sep 2015
Case Study Award, Operations Research Society Japan
Winner: Takanobu Nakahara, Yukinobu Hamuro, Takeaki Uno, Satoshi Kitajima
 
Mar 2015
Community Analysis via Attendance to Special Interest Group Meetings, I-Scover Challenge 2014 Best Award, Institute of Electronics, Information and Communication Engineers
 
Oct 2014
Clustering by Clique Enumeration and Data Cleaning like Method, IPSJ Yamashita SIG Research Award, Information Processing Society Japan
 
Jul 2013
Optimization Algorithm for κ-Anonymity of Large-Scale Database, JSAI Incentive Award, The Japanese Society for Artificial Intelligence
Winner: Keisuke Murakami, Takeaki Uno
 

Published Papers

 
Alessio Conte,Roberto Grossi,Andrea Marino,Takeaki Uno,Luca Versari
String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings   144-160   Sep 2017   [Refereed]
Alessio Conte,Mamadou Moustapha Kanté,Yota Otachi,Takeaki Uno,Kunihiro Wasa
Computing and Combinatorics - 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings   150-161   Aug 2017   [Refereed]
Mamadou Moustapha Kanté,Takeaki Uno
Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Bern, Switzerland, April 20-22, 2017, Proceedings   333-347   Apr 2017   [Refereed]
Katsuhisa Yamanaka,Erik D. Demaine,Takashi Horiyama,Akitoshi Kawamura,Shin-Ichi Nakano,Yoshio Okamoto,Toshiki Saitoh,Akira Suzuki,Ryuhei Uehara,Takeaki Uno
WALCOM: Algorithms and Computation, 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29-31, 2017, Proceedings.   435-447   Mar 2017   [Refereed]
Bicluster Mining by Data Cleaning like Approach
Takeaki Uno, Atsushi Koike, Takanobu Nakahara, Yukinobu Hamuro
SIGAL, IPSJ   157 1-8   Mar 2017
Mining preserving structures in a graph sequence
Takeaki Uno, Yushi Uno
Theoretical Computer Science   654 155-163   Nov 2016   [Refereed]
Approximation and Hardness of Token Swapping
Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, Takeaki Uno
European Symposium on Algorithms 2016   66 1-15   Sep 2016   [Refereed]
Computational Complexity of Sequential Token Swapping Problem
Katsuhisa Yamanaka(Iwate Univ.), Erik D. Demaine(MIT), Takashi Horiyama(Saitama Univ.), Akitoshi Kawamura(Univ. of Tokyo), Shin-ichi Nakano(Gunma Univ.), Yoshio Okamoto(UEC), Toshiki Saitoh(Kobe Univ.), Akira Suzuki(Tohoku Univ.), Ryuhei Uehara(JAIST), Takeaki Uno(NII)
電子情報通信学会コンピュテーション研究会資料   2016(13) 115-121   Jun 2016
A Partition-Based Heuristic Algorithm for the Rectilinear Block Packing Problem
Yannan Hu, Hideki Hashimoto, Shinji Imahori, Takeaki Uno, Mutsunori Yagiura
The Journal of the Operations Research Society of Japan   59 110-129   Feb 2016   [Refereed]
Takehiro Ito,Shin-Ichi Nakano,Yoshio Okamoto,Yota Otachi,Ryuhei Uehara,Takeaki Uno,Yushi Uno
Comput. Geom.   51 25-39   2016   [Refereed]
Mining Preserving Structures in a Graph Sequence
Takeaki Uno, Yushi Uno
LNCS COCOON 2015   9198 3-15   Aug 2015   [Refereed]
Constant Time Enumeration by Amortization
Takeaki Uno
LNCS WADS 2015   9214 593-605   Aug 2015   [Refereed]
Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
LNCS WADS 2015   9214 -takeakiuno   Aug 2015   [Refereed]
Swapping labeled tokens on graphs
Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
Theoretical Computer Science   586 81-94   Apr 2015   [Refereed]
Map Merging Using Iterative Cycle Consistency Check and Spanning Tree Selection by RANSAC
Masahiro Tomono, Takeaki Uno
20    Mar 2015
Masahiro Tomono,Takeaki Uno
2015 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2015, Hamburg, Germany, September 28 - October 2, 2015   5662-5669   2015   [Refereed]
Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph
Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
ISAAC 2014   2014 94-102   Dec 2014   [Refereed]
An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths
Takeaki Uno, Hiroko Satoh
Discovery Science 2014   2014 313-324   Oct 2014   [Refereed]
Base-Object Location Problems for Base-Monotone Regions
Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno
Theoretical Computer Science   555 71-84   Oct 2014   [Refereed]
Prediction Model Using Micro-clustering
Takanobu Nakahara, Takeaki. Uno, Yukinobu Hamuro
18th International Conference on Knowledge-Based and Intelligent Information & Engineering Systems   35 .1488-1494   Sep 2014   [Refereed]
A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks
Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
Theoretical Computer Science   544 14-31   Aug 2014   [Refereed]
Efficient Algorithms for Dualizing Large-scale Hypergraphs
Keisuke Murakami, Takeaki Uno
Discrete Applied Mathematics   (170) 83-94   Jun 2014   [Refereed]
Enumeration of Induced Subtrees in a K-Degenerate Graph
Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
148(17) 1-6   Jun 2014
Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set
Takashi Horiyama, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi
FUN 2014   230-239   Jun 2014   [Refereed]
Swapping Labeled Tokens on Graphs
Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
FUN 2014   2014 364-375   Jun 2014   [Refereed]
A Fast Method of Statistical Assessment for Combinatorial Hypotheses Based on Frequent Itemset Enumeration
Shin-ichi Minato, Takeaki Uno, Koji Tsuda, Aika Terada, Jun Sese
ECML/PKDD (2) 2014   2014 422-436   Jun 2014   [Refereed]
Chemical Structure Elucidation from 13C NMR Chemical Shifts: Efficient Data Processing Using Bipartite Matching and Maximal Clique Algorithms
Shungo Koichi, Masaki Arisaka, Hiroyuki Koshino, Atsushi Aoki, Satoru Iwata, Takeaki Uno, Hiroko Satoh
Journal of Chemical Information and Modeling   54(4) 1027-1035   Apr 2014   [Refereed]
Constant Time Enumeration of Subtrees with Exactly k Nodes in a Tree
Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, Hiroki Arimura
IEICE Transactions   97D(3) 421-430   Mar 2014   [Refereed]
Toward Constant Time Enumeration
Takeaki Uno
SIGAL, IPSJ   147 1-8   Mar 2014
Chemical Structure Elucidation from 13C NMR Chemical Shifts: Efficient Data Processing Using Bipartite Matching and Maximal Clique Algorithms
Shungo Koichi, Masaki Arisaka, Hiroyuki Koshino, Atsushi Aoki, Satoru Iwata, Takeaki Uno, Hiroko Satoh
Journal of Chemical Information and Modeling   54(4) 1027-1035   Mar 2014   [Refereed]
UNO is hard, even for a single player
Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey, Ryuhei Uehara, Takeaki Uno, Yushi Uno
Theoretical Computer Science   521 51-61   Jan 2014   [Refereed]
On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
Lecture Notes in Computer Science (ISAAC2013)   8283 339-349   Dec 2013   [Refereed]
An algorithm for finding frequent appearing long string patterns from large scale databases
Takeaki Uno, Juzo Umemori, Tsuyoshi Koide
   Nov 2013
Mining-based Compression Approach of Propositional Formulae
Saïd Jabbour, Lakhdar Sais, Yakoub Salhi, Takeaki Uno
ACM International Conference on Information and Knowledge Management (CIKM 2013)   289-298   Oct 2013   [Refereed]
Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph
Kunihiro Wasa, Takeaki Uno, Kouichi Hirata, Hiroki Arimura
Lecture Notes in Computer Science (DS2013)   8140 308-323   Oct 2013   [Refereed]
A New Approach to String Pattern Mining with Approximate Match
Tetsushi Matsui, Takeaki Uno, Juzoh Umemori, Tsuyoshi Koide
Lecture Notes in Computer Science (DS2013)   8140 110-125   Oct 2013   [Refereed]
Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees
Kunihiro Wasa, Kouichi Hirata, Takeaki Uno, Hiroki Arimura
Lecture Notes in Computer Science (SISAP2013)   8199 73-84   Sep 2013   [Refereed]
Takeaki Uno, Ryuhei Uehara, Shin-ichi Nakano
Discrete Mathematics, Algorithms and Applications   5 1360001-1350014   Jun 2013   [Refereed]
Algorithm to Generate All Connected Simple Graphs of Given Order
Matsui Tetsushi, Uno Takeaki
2013-AL-143(15) 1-5   Mar 2013
Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama , Ryuhei Uehara and Takeaki Uno
Lecture Notes in Computer Science (WALCOM2013)   7748 53-64   Feb 2013   [Refereed]
Efficient Algorithms for Dualizing Large-scale Hypergraphs
Keisuke Murakami, Takeaki Uno
SIAM: Algorithm Engineering and Experiments, 2013   1-13   Jan 2013   [Refereed]
Efficient Algorithms for a Simple Network Design Problem
Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
Networks   62(2) 95-104   2013   [Refereed]
On Complexity of Flooding Games on Graphs with Interval Representations
Hiroyuki Fukui, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
Lecture Notes in Computer Science Volume (TJJCCGG2012)   8296 73-84   Dec 2012   [Refereed]
A 4.31-approximation for the Geometric Unique Coverage Problem on Unit Disks
Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
Lecture Notes in Computer Science (ISAAC 2012)   7676 372-381   Dec 2012   [Refereed]
Subgraph Isomorphism in Graph Classes
Shuji Kijima, Yota Otachi, Toshiki Saitoh, and Takeaki Uno
Discrete Mathematics   312(21) 3164-3173   Sep 2012   [Refereed]
Kunihiro Wasa, Takeaki Uno and Hiroki Arimura
Lecture Notes in Computer Science (COCOON2012)   7434 347-359   Aug 2012   [Refereed]
Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno and Yushi Uno
Lecture Notes in Computer Science (SWAT 2012)   7357 24-35   Jul 2012   [Refereed]
Akira Suzuki, Kei Uchizawa, and Takeaki Uno
Lecture Notes in Computer Science (FUN2012)   7288 334-345   Jun 2012   [Refereed]
Takeaki Uno, Ryuhei Uehara and Shin-Ichi Nakano
Lecture Notes in Computer Science (WALCOM2012)   7157 5-16   Feb 2012   [Refereed]
Efficient Computation of Power Indices for Weighted Majority Games
Takeaki Uno
Lecture Notes in Computer Science (ISAAC 2012)   7676 679-689   2012   [Refereed]
Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno and Hamid Zarrabi-Zadeh
Algorithmica   64(2) 311-325   2012   [Refereed]
Takeaki Uno, Ryuhei Uehara and Shin-Ichi Nakano
LNCS, WALCOM: Algorithm and Computation7157   7157 5-16   2012   [Refereed]
Proc. of WALCOM 2012 (2012.2.15-17, Dhaka, Bangladesh)
Partitioning aWeighted Tree into Subtrees
Takehiro Ito, Takao Nishizeki, Michael Schroder, Takeaki Uno, Xiao Zhou
Algorithmica   62 823-841   2012   [Refereed]
Partitioning a Weighted Tree into Subtrees with Weights in a Given Range
Takehiro Ito, Takao Nishizeki, Michael Schröder, Takeaki Uno and Xiao Zhou
Algorithmica   62(3-4) 823-841   2012   [Refereed]
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem
Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno
Journal of Graph Algorithms and Applications   15(6) 727-751   Nov 2011   [Refereed]
Dominating Set Counting in Graph Classes
Shuji Kijima, Yoshio Okamoto and Takeaki Uno
Lecture Notes in Computer Science (COCOON2011)   6842 13-24   Aug 2011   [Refereed]
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem
Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, and Takeaki Uno
TAMC 2011, LNCS, M. Ogihara and J. Tarui (Eds.)   (6648) 452-462   May 2011   [Refereed]
Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width
Benjamin Hellouin de Menibus and Takeaki Uno
TAMC 2011, LNCS, M. Ogihara and J. Tarui (Eds.):   (6648) 483-494   May 2011   [Refereed]
Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width
Benjamin Hellouin de Menibus, Takeaki Uno
Lecture Notes in Computer Science (TAMC2011)   6648 483-494   May 2011   [Refereed]
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem
Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno
Lecture Notes in Computer Science (TAMC2011)   6648 452-462   May 2011   [Refereed]
Tobias Christ, Andrea Francke, Heidi Gebauer, Jiri Matousek, Takeaki Uno
Computational Geometry      Apr 2011   [Refereed]
Yoshio Okamoto, Takeaki Uno
European Journal of Operational Research   210(1) 48-56   Mar 2011   [Refereed]
Keisuke Murakami and Takeaki Uno
Data Structures and Algorithms      Feb 2011   [Refereed]
A Doubly Exponentially Crumbled Cake
Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno
Electronic Notes in Discrete Mathematics   38 265-271   2011   [Refereed]
Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara and Takeaki Uno
Graphs and Combinatorics   27(3) 341-351   2011   [Refereed]
Dominating Set Counting in Graph Classes
Shuji Kijima, Yoshio Okamoto, and Takeaki Uno
Proceeding of COCOON 2011      2011   [Refereed]
Levelwise Mesh Sparsification
Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo
Lecture Notes in Computer Science (ISAAC2010)   6506 121-132   Dec 2010   [Refereed]
Takeaki Uno
Knowledge and Information Systems   25(2) 229-251   Nov 2010   [Refereed]
負の重みに対応した高速頻出集合発見プログラムの開発
宇野 毅明
電子情報通信学会論文誌. D, 情報・システム   J93-D(11) 2437-2445   Nov 2010   [Refereed]
Yasuko Matsui, Ryuhei Uehara and Takeaki Uno
Theoretical Computer Science   411(40-42) 3635-3641   Sep 2010   [Refereed]
Takanobu Nakahara, Takeaki Uno and Katsutoshi Yada
Lecture Notes in Computer Science (KES2010)   6278 244-253   Sep 2010   [Refereed]
Finding Maximum Edge Bicliques in Convex Bipartite Graphs
Doron Nussbaum, Shuye Pu, Jorg-Rudiger Sack, Takeaki Uno and Hamid Zarrabi-Zadeh
Lecture Notes in Computer Science (Proc. COCOON2010)   6196 140-149   Jul 2010   [Refereed]
Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings
Tobias Christ, Michael Hoffmann, Yoshio Okamoto and Takeaki Uno
Algorithmica   57(3) 499-516   Jul 2010   [Refereed]
UNO is hard, even for a single player
Erik D. Demaine, Martin L. Demaine, Uehara Ryuhei, Uno Takeaki and Uno Yushi
(1744) 48-55   Jun 2010
UNO Is Hard, Even for a Single Player
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno and Yushi Uno
Lecture Notes in Computer Science (Proc. FUN2010)   6099 133-144   Jun 2010   [Refereed]
Decouverte d'itemsets frequents fermes sur architecture multicoeurs
Benjamin Negrevergne, Jean-Francois Mehaut, Alexandre Termier and Takeaki Uno
Proc. of EGC2010   465-470   Jun 2010   [Refereed]
Extraction et gestion des connaissances (EGC'2010), Actes, 26 au 29 janvier 2010, Hammamet, Tunisie
UNO Is Hard, Even for a Single Player
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno
Lecture Notes in Computer Science (FUN 2010)   6099 133-144   Jun 2010   [Refereed]
Single Versus Multiple Sorting in All Pairs Similarity Search
Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji Tsuda
The 2nd Asian Conference on Machine Learning (ACML)      Apr 2010   [Refereed]
Frequentness-Transition Queries for Distinctive Pattern Mining from Time-Segmented Databases
Shin-ichi Minato and Takeaki Uno
Proceedings of the SIAM International Conference on Data Mining, SDM 2010   339-349   Apr 2010   [Refereed]
April 29 - May 1, 2010, Columbus, Ohio, USA. SIAM 2010
Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto and Takeaki Uno
Theoretical Computer Science   411(26-28) 2591-2601   Mar 2010   [Refereed]
Takeaki Uno
Algorithmica   56(1) 3-16   Jan 2010   [Refereed]
Student Mental State Inference from Unintentional Body Gestures Using Dynamic Bayesian Networks
Abdul Rehman Abbasi, Matthew N. Dailey, Nitin V. Afzulpurkar and Takeaki Uno
Journal on Multimodal User Interfaces   3(1) 21-31   Jan 2010   [Refereed]
Decouverte d'itemsets frequents fermes sur architecture multicoeurs.
Benjamin Negrevergne, Jean-Francois Mehaut, Alexandre Termier, Takeaki Uno
EGC 2010   465-470   2010   [Refereed]
Frequentness-Transition Queries for Distinctive Pattern Mining from Time-Segmented Databases
Shin-ichi Minato, Takeaki Uno
SDM2010   339-349   2010   [Refereed]
Single versus Multiple Sorting in All Pairs Similarity Search
Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji Tsuda
Journal of Machine Learning Research - Proceedings Track   13 145-160   2010   [Refereed]
Levelwise Mesh Sparsification for Shortest Path Queries
Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo
ISAAC   1 121-132   2010   [Refereed]
Benjamin Negrevergne, Alexandre Termier, Jean-Francois Mehaut and Takeaki Uno
International Conference on High Performance   521-528   2010   [Refereed]
Enumeration of Perfect Sequences of Chordal Graph
Yasuko Matsui, Ryuhei Uehara, Takeaki Uno
RIMS Workshop on Acceleration and Visualization of Computation for Enumeration Problems   1644 86-94   Sep 2009
Genome Homology Visualization by Short Similar Substring Enumeration
Takeaki Uno
RIMS Workshop on Acceleration and Visualization of Computation for Enumeration Problems   1644 35-43   Sep 2009
Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno
Lecture Notes in Computer Science (WG2009)   5911 296-307   Jun 2009   [Refereed]
Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes
Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno
COMP2009-24   (109) 45-52   Jun 2009
Enumeration of Condition-Dependent Dense Modules in Protein Interaction Networks
Elisabeth Georgii, Sabine Dietmann, Takeaki Uno, Philipp Pagel, Koji Tsuda
Bioinformatics   25(7) 933-940   Apr 2009   [Refereed]
A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs
Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
Journal of Computer Science and Technology   24(3) 517-533   2009   [Refereed]
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems
Hiroki Arimura, Takeaki Uno
Proceedings of the Ninth SIAM International Conference on Data Mining (SDM 2009)   1087-1098   2009   [Refereed]
Kevin Buchina, Andreas Razenb, Takeaki Uno, Uli Wagner
Computational Geometry   42(8) 724-730   2009   [Refereed]
Juzoh Umemori, Takeaki Uno, Shigeki Yuasa, Tsuyoshi Koide
Neuroscience Research   65(Sup.1) S53   2009   [Refereed]
Efficient Serial Episode Mining with Minimal Occurrences
Hideyuki Ohtani, Takuya Kida, Takeaki Uno, Hiroki Arimura
International Conference on Ubiquitous Information Management and Communication   457-464   2009   [Refereed]
Enumeration of Perfect Sequences of Chordal Graph
Yasuko Matsui, Ryuhei Uehara, Takeaki Uno
Lecture Notes in Computer Science (ISAAC2008)   5369 859-870   Dec 2008   [Refereed]
Partitioning a Weighted Tree to Subtrees of Almost Uniform Size
Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki
Lecture Notes in Computer Science (ISAAC2008)   5369 196-207   Dec 2008   [Refereed]
Obtaining Self-Reports for Affective System Design
Abdul Rehman Abbasi, Nitin V. Afzulpurkar, Matthew N.Dailey, Takeaki Uno
NordiCHI2008 Workshop on Research Goals & Strategies for Studying User Experience and Emotion      Oct 2008

Misc

 
UNO Takeaki
IEICE Fundamentals Review   9(2) 142-146   2015
Community mining aims to find groups with dense relations among its members from networks such as those on SNSs. It is used not only in data mining and clustering but also for directly obtaining knowledge from the groups. Community mining in resea...
Uno Takeaki
JRSJ   33(2) 20-23   2015   [Invited]
AKACHI Sachiko, IKEGAMI Atsuko, UNO Takeaki
J. Jpn . Ind. Manage. Assoc.   64(3) 488-497   Oct 2013
When making a schedule in a home help station the scheduler has to ensure each service can be provided on time by an appropriate helper. The scheduler must consider the working hours and intensity of the work, the traveling time to and from the us...
High-Speed Clique / Dense Subgraph Mining Algorithms
Taleaki Uno
Japanese Society for Artificial Intelligence Journal   27(3) 246-251   May 2012
High Speed Computation on Genome Informatics
Takeaki Uno
The Journal of the Institute of Electronics, Information and Communication Engineers   92(2) 125-130   Feb 2009
Revolutionarily Fast Algorithms for Info-plosion Era
Takeaki Uno, Shin-ichi Minato, Masayuki Takeda
(Journal of Information Processing Society of Japan   49(8) 897-903   Aug 2008
Data Intensive Computing : No.2 Frequent Itemset Mining Algorithms
Takeaki Uno, Hiroki Arimura
Japanese Society for Artificial Intelligence Journal   17(2) 425-436   May 2007
Recent Topics of Enumeration Algorithms
Takeaki Uno
The Journal of the Institute of Electronics, Information and Communication Engineers   86(12) 928-933   Dec 2003
Efficient Construction and Use of Enumeration Algorithms (Part 3) : Hard Enumeration Problems and Reverse Search
Takeaki Uno
Japanese Society for Artificial Intelligence Journal   18(5) 586-591   Sep 2003
Efficient Construction and Use of Enumeration Algorithms (Part 2) : How to Construct Enumeration Algorithms
Takeaki Uno
Japanese Society for Artificial Intelligence Journal   18(4) 433-438   Jul 2003
Efficient Construction and Use of Enumeration Algorithms(Part 1) : Approaches to Models in AI by Enumeration
Takeaki Uno
The Japanese Society for Artificial Intelligence Journal   18(3) 317-322   May 2003

Books etc

 
Encyclopedia of Algorithms
Takeaki Uno (Part:Joint Editor, Enumeration Algorithm)
Springer   Jan 2015   

Conference Activities & Talks

 
BIG DATA
Takeaki Uno
Japan America Frontier of Engineering   18 Jun 2016   
Clarifying Lattice Structure by Data Polishing [Invited]
Takeaki Uno
The 12th International Conference on Concept Lattices and their Applications   16 Oct 2015   
Toward Constant time Enumeration by Amortized Analysis
Takeaki Uno
Enumeration Algorithms Using Structure   27 Aug 2015   
Mining Graph Structures Preserved Long Period
Takeaki Uno, Yushi Uno
Discovery Science 2014   9 Oct 2014   
Data Polishing: Making DataSimple and Understandable [Invited]
Takeaki Uno
ALSIP, special seminar   12 Dec 2014   
BigData in Japanese Academia and New Approach for Clustering [Invited]
Takeaki Uno
Symposium of Petasky Project in Observatoire de Paris   27 Jun 2014   
Data Modificati on Approach to Efficient Cluster Mining [Invited]
Takeaki Uno
The Japanese-Swiss Workshop on Combinatorics and Computational Geometry   5 Jun 2014   
Similarity based Approach for Compression of Noisy Data [Invited]
Takeaki Uno
NII Shonan Meeting, Compact Data Structures for Big Data   30 Sep 2013   
Frequent String Mining from Large Scale Noisy Data
Takeaki Uno
COSI2013 workshop, Data mining day   12 Jun 2013   
Data Oriented Approach for Pattern Mining - toward a paradigm shift -
Takeaki Uno
Colloque sur l'Optimisation et les Systèmes d'Information   11 Jun 2013   
How to Refine Pattern Mining
Takeaki Uno
NII Shonan meeting, Dimensionality and Scalability   21 May 2013   
FPT for Scalable Mining Algorithms [Invited]
Takeaki Uno
NII Shonan meeting, Parameterized Complexity and the Understanding, Design and Analysis of Heuristics   10 May 2013   
Deep of Enumeration Algorithm, theory and application –theory and practice- [Invited]
Takeaki Uno
Enumeration Algorithms & Exact Methods   Sep 2012   
Between Optimization <=> Enumeration [Invited]
Takeaki Uno
NII Shonan Meeting - Parallel Methods for Constraint Solving and Combinatorial Optimization   May 2012   
Computational Challenges in BIG DATA [Invited]
Takeaki Uno
China-Japan-Korea Young Researchers Workshop   Apr 2012   
Fast Algorithms for BIG DATA [Invited]
Takeaki Uno
NII Shonan Meeting - Large-scale Distributed Computation   Jan 2012   
Epigenetic abnormality of genetic incompatibility mouse, Genic mice
Juzoh Umemori, Takeaki Uno, Shigeki Yuasa, Tsuyoshi Koide
Neuroscience 2010   Nov 2010   
Bounding #Reduced Trees [Invited]
Takeaki Uno
Combinatorial Algorithm Day   Jun 2010   
Bounding #Reduced Trees [Invited]
Takeaki Uno
4th Combinatorial Algorithms Day   Jun 2010   
文字列の類似構造発見問題と複数分類アルゴリズム [Invited]
宇野 毅明
東京大学コンピュータ科学専攻 講義講演会   Feb 2010   
Levelwise mesh sparsification for point-to-point shortest path queries
Yuichiro Miyamoto and Takeaki Uno
23rd European Conference on Operational Research   Jul 2009   
Reducing the workload of modification in smallscale staff scheduling from strategies of optimization
Takuma Kubo and Takeaki Uno
23rd European Conference on Operational Research   Jul 2009   
High speed pattern mining for huge data --algorithm and implementation--
Takeaki Uno
23rd European Conference on Operational Research   Jul 2009   
Probabilistic Prediction of Student Affect from Hand Gestures
A.R.Abbasi, M.N. Dailey, N.V.Afzulpurkar and Takeaki Uno
Intl. Conf. on Automation, Robotics and Control Systems   Jan 2008   
Output Sensitive Algorithm for Finding Similar Objects [Invited]
Takeaki Uno
the 1st Combinatorial Algorithms Day   2 Jul 2007   
Transforming Spanning Trees: A Lower Bound
Kevin Buchin, Andreas Razen, Takeaki Uno and Uli Wagner
23nd European Workshop on Computational Geometry   Mar 2007   
Algorithms for Maximizing the Volume of Intersection of Polytopes
Komei Fukuda and Takeaki Uno
22nd European Workshop on Computational Geometry   Mar 2006   
Enumerating Labeled Chordal Graphs on Complete Graph
Masashi Kiyomi and Takeaki Uno
4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications   Jun 2005   
Speeding up Immediate selections on Job Shop Scheduling Problems
Takeaki Uno
International Symposium on Mathematical Programming 2000   8 Aug 2000   
A Speeding up Technique for Heuristic Algorithms on the Vehicle Routing Problems
Takeaki Uno
INFORMS-KORMS Seoul 2000 Conference   19 Jun 2000   
Dynamic Data Structure for Local Search on Vehicle Routing Problem with Soft Time Window Constraints
Takeaki Uno
The International Federation of Operational Reseach Societies   18 Aug 1999   
A Fast Enumeration algorithm for all Directed Spanning Trees in a Directed Graph
Takeaki Uno
International Symposium on Mathematical Programming   28 Aug 1997   
A Simple and Fast Algorithm for Enumerating all Edge Colorings of a Bipartite Graph
Takeaki Uno, Yasuko Matsui
9th Franco-Japanese Days on Combinatorics and Optimization   15 Oct 1996   
A liner time algorithm for finding a k-tree-core of a tree
Takeaki Uno, Akiyoshi Shioura
Asian-Pacific Operational Research Society 94   29 Jul 1994   
A liner time algorithm for finding a k-tree-core of a tree
Takeaki Uno, Akiyoshi Shioura
International Symposium of Mathematical Programming   18 Jul 1994   

Research Grants & Projects

 
Data Particlization for Next Generation Data Mining
Japan Sience and Technology Agency: CRESt: Advanced Core Technologies for Big Data Integration
Project Year: Oct 2014 - Mar 2020    Investigator(s): Takeaki Uno
Developing Algorithmic Paradime for Similarity Structure Analysis in Large Scale Data
Japan Science and Technology Agency: PRESTO Synthesis of Knowledge for Information Oriented Society
Project Year: Oct 2009 - Mar 2013    Investigator(s): Takeaki Uno
A theoretical Approach to Efficient Maximal/Minimal Enumeration Algorithm and its Applications
Japan Society for the Promotion of Science: Grants-in-Aid for Scientific Research
Project Year: Apr 2007 - Mar 2011    Investigator(s): Takeaki Uno
A theoretical Approach to Practical Efficient Enumeration Algorithms
Japan Society for the Promotion of Science: Grants-in-Aid for Scientific Research
Project Year: Apr 2004 - Mar 2008    Investigator(s): Takeaki Uno
Japan Society for the Promotion of Science: Grants-in-Aid for Scientific Research
Project Year: Apr 2001 - Mar 2003    Investigator(s): Takeaki Uno