Hiroshi Motoda mainly focuses on Data mining, Artificial intelligence, Feature selection, Machine learning and Mathematical optimization. Hiroshi Motoda interconnects Application-specific integrated circuit, Model selection and Data science in the investigation of issues within Data mining. His research in Artificial intelligence tackles topics such as Pattern recognition which are related to areas like Test set and Selection.
His studies deal with areas such as Selective sampling, Measure, Search algorithm and Dimensionality reduction as well as Feature selection. His Mathematical optimization research is multidisciplinary, incorporating elements of Algorithm, Blocking, Degree and Social network. His studies in Algorithm integrate themes in fields like Association rule learning and Supervised learning.
Data mining, Artificial intelligence, Machine learning, Graph and Algorithm are his primary areas of study. His work deals with themes such as Set, Data science and Social network, which intersect with Data mining. His work is dedicated to discovering how Artificial intelligence, Pattern recognition are connected with Graph based and other disciplines.
His Graph study combines topics from a wide range of disciplines, such as Computational complexity theory, Directed graph, Greedy algorithm, Pairwise comparison and Graph. Many of his studies on Algorithm apply to Change detection as well. He combines subjects such as Ripple-down rules, Knowledge base and Knowledge-based systems with his study of Knowledge extraction.
The scientist’s investigation covers issues in Centrality, Node, Data mining, Network performance and Betweenness centrality. His Centrality study also includes
His biological study spans a wide range of topics, including Node, Set, Multinomial distribution, Information retrieval and Synthetic data. His studies examine the connections between Probabilistic logic and genetics, as well as such issues in Statistical model, with regards to Data science. His work carried out in the field of Katz centrality brings together such families of science as Machine learning and Artificial intelligence.
Hiroshi Motoda mainly focuses on Node, Centrality, Artificial intelligence, Machine learning and Betweenness centrality. His Centrality research includes elements of Spatial network and Mathematical optimization, Maximization, Greedy algorithm. His research in Artificial intelligence intersects with topics in Katz centrality, Order, Moment and Network controllability.
His Machine learning research includes themes of Baseline, Reliability, Social media mining and Mobile phone. His Betweenness centrality research is multidisciplinary, relying on both Closeness and Data mining. His work on Social network analysis expands to the thematically related Data mining.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Top 10 algorithms in data mining
Xindong Wu;Vipin Kumar;J. Ross Quinlan;Joydeep Ghosh.
Knowledge and Information Systems (2007)
Feature Selection for Knowledge Discovery and Data Mining
Huan Liu;Hiroshi Motoda.
(1998)
Computational Methods of Feature Selection
Huan Liu;Hiroshi Motoda.
(2007)
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
Akihiro Inokuchi;Takashi Washio;Hiroshi Motoda.
european conference on principles of data mining and knowledge discovery (2000)
Feature Extraction, Construction and Selection: A Data Mining Perspective
Huan Liu;Hiroshi Motoda.
Journal of the American Statistical Association (1998)
A flash-memory based file system
Atsuo Kawaguchi;Shingo Nishioka;Hiroshi Motoda.
usenix annual technical conference (1995)
State of the art of graph-based data mining
Takashi Washio;Hiroshi Motoda.
Sigkdd Explorations (2003)
Feature Extraction, Construction and Selection
Huan Liu;Hiroshi Motoda.
(1998)
Feature Selection: An Ever Evolving Frontier in Data Mining
Huan Liu;Hiroshi Motoda;Rudy Setiono;Zheng Zhao.
Feature Selection in Data Mining (2010)
Complete Mining of Frequent Patterns from Graphs: Mining Graph Data
Akihiro Inokuchi;Takashi Washio;Hiroshi Motoda.
Machine Learning (2003)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Arizona State University
University of Technology Sydney
University of Technology Sydney
Japan Advanced Institute of Science and Technology
University of Minnesota
University of Alberta
University of Illinois at Chicago
National Yang Ming Chiao Tung University
Jozef Stefan Institute
Ghent University
Shanghai Jiao Tong University
Florida State University
University of Valladolid
Recognis Oy
Clemson University
University of Adelaide
National Institutes of Health
Spanish National Research Council
Queen Mary University of London
Kansas State University
Grenoble Alpes University
The University of Texas Southwestern Medical Center
Yale University
Johns Hopkins University
Lawrence Livermore National Laboratory
University of Tübingen