Masahito Kurihara

ORCID: 0000-0002-1478-1093
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Logic, programming, and type systems
  • Formal Methods in Verification
  • Constraint Satisfaction and Optimization
  • Semantic Web and Ontologies
  • Logic, Reasoning, and Knowledge
  • Data Management and Algorithms
  • Software Testing and Debugging Techniques
  • Natural Language Processing Techniques
  • AI-based Problem Solving and Planning
  • Complex Network Analysis Techniques
  • Software Engineering Research
  • Model-Driven Software Engineering Techniques
  • Neural Networks and Applications
  • Scheduling and Timetabling Solutions
  • Recommender Systems and Techniques
  • Multi-Agent Systems and Negotiation
  • Machine Learning and Data Classification
  • Advanced Graph Neural Networks
  • Advanced Text Analysis Techniques
  • Mobile Crowdsensing and Crowdsourcing
  • Data Stream Mining Techniques
  • Transportation Planning and Optimization
  • Music and Audio Processing
  • Sentiment Analysis and Opinion Mining
  • Mobile Agent-Based Network Management

Hokkaido University
2013-2022

Hokkai Gakuen University
2016

Hokkaido Information University
2002-2012

Tokyo Institute of Technology
2010

Network Technologies (United States)
2009

Kanagawa Institute of Technology
2009

Hokkaido University of Science
1996-2008

The University of Tokyo
2007

Ibaraki University
2002

Hitachi (Japan)
2002

Although supervised learning requires a labeled dataset, obtaining labels from experts is generally expensive. For this reason, crowdsourcing services are attracting attention in the field of machine as way to collect at relatively low cost. However, obtained by crowdsourcing, i.e., non-expert workers, often noisy. A number methods have thus been devised for inferring true labels, and several proposed classifiers directly crowdsourced referred "learning crowds." more practical problem data...

10.1609/aaai.v32i1.11513 article EN Proceedings of the AAAI Conference on Artificial Intelligence 2018-04-25

10.1016/0304-3975(92)90015-8 article EN publisher-specific-oa Theoretical Computer Science 1992-09-01

10.5281/zenodo.1058297 article EN cc-by Zenodo (CERN European Organization for Nuclear Research) 2007-01-22

A reachability matrix M is a binary with the reflexive and transitive property, i.e., + I = M, M2 where identity matrix. The entries of are shown to form multilevel implication structure derived using transitivity property. fundamental P that defines this derived. Q closure P, complete matrix, defined. It proved p2. problem efficiently filling partially filled considered. An algorithm for determining all implied values unknown elements from supplied value proposed. requires 0(n2) computer...

10.1109/tsmc.1986.289267 article EN IEEE Transactions on Systems Man and Cybernetics 1986-07-01

Machine learning is the basis of important advances in artificial intelligence. Unlike general methods machine learning, which use same tasks for training and testing, method transfer uses different to learn a new task. Among various algorithms literature, we focus on attribute-based learning. This algorithm realizes by introducing attributes transferring results another task with common attributes. However, existing does not consider frequency each attribute appears feature vectors (called...

10.1109/smc.2014.6974493 article EN 2022 IEEE International Conference on Systems, Man, and Cybernetics (SMC) 2014-10-01

Recommendation systems help consumers find useful items of information given a large amount while avoiding overload. Nowadays, in addition to traditional evaluation (such as individual reviewer ratings), such multicriteria ratings are available on the Web. In work reported here, we investigated whether collaborative filtering methods using data and deep learning effective for abundant sparse data. We also adaptability can be achieved by predicting aggregated from evaluations few users....

10.1016/j.asoc.2022.108548 article EN cc-by Applied Soft Computing 2022-02-14

This paper presents the general architecture of geographic information systems (GIS) for assisting users in creating barrier-free street maps by using Internet and highly accurate global positioning (GPS). The purpose system is to provide an effective tool supporting creation use network-based physically-handicapped people wheelchairs. wheelchairs are equipped with GPS antenna tablet PC computing current positions a cm-class accuracy navigate streets. server collects from moving around local...

10.1109/icsmc.2004.1399782 article EN 2005-03-31

Refactoring is one of the promising techniques for improving program design by means transformation with preserving behavior, and widely applied in practice. However, it difficult engineers to identify how where refactor programs, because proper knowledge skills a high order are required them. In this paper, we propose technique instruct using sequence its modifications. We consider that histories modifications reflect developers' intentions, focusing on them allows us provide suitable...

10.1093/ietisy/e89-d.4.1403 article EN IEICE Transactions on Information and Systems 2006-04-01

10.1016/0020-0190(90)90221-i article EN Information Processing Letters 1990-02-01

Photo Voltaic (PV) devices have a Maximum Power Point (MPP) at which they generate maximum power. Because the MPP depends on solar radiation and PV panel temperature, it is not constant over time. A Tracker (MPPT) widely used to continuously obtain power, but if changes rapidly, efficiency of most classic MPPT (e.g., Perturbation Observation (P&O) method) reduces. controllers using neural network respond quickly rapidly changing must usually undergo prelearning PV-specific data, so we...

10.20965/jaciii.2010.p0677 article EN cc-by-nd Journal of Advanced Computational Intelligence and Intelligent Informatics 2010-09-20

Knuth–Bendix completion is a classical calculus in automated deduction for transforming set of equations into confluent and terminating directed which can be used to decide the induced equational theory. Multi-completion with termination tools constitutes an approach that differs from method two respects: (1) external replace reduction order—a typically critical parameter—as proposed by Wehrman et al. (2006), (2) multi-completion as introduced Kurihara Kondo (1999) keep track multiple...

10.1007/s10817-012-9249-2 article EN cc-by Journal of Automated Reasoning 2012-04-13

We present a comprehensive framework of search methods, such as simulated annealing and batch training, for solving nonconvex optimization problems. These methods wider range by gradually decreasing the randomness added to standard gradient descent method. The formulation that we define on basis this can be directly applied neural network training. This produces an effective approach increases size during also explain why large training degrades generalization performance, which previous...

10.1162/neco_a_01089 article EN Neural Computation 2018-04-13

10.1023/a:1006129631807 article EN Journal of Automated Reasoning 1999-01-01

The authors propose a method for personalizing the flexible widget layout (FWL) by adjusting desirability of widgets with pairwise comparison method, and show its implementation that it actually works. Personalization graphical user interfaces (GUIs) is important from perspective usability, challenge in field model-based interface designs. FWL model- optimization-based framework GUIs offering possibility personalization, but has not realized any concrete yet. In this paper, implement...

10.1145/1570433.1570481 article EN 2009-07-15

10.1007/s41060-017-0063-0 article EN International Journal of Data Science and Analytics 2017-07-21
Coming Soon ...