default search action
Katsutoshi Kanamori
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j3]Kazutaka Nishiwaki, Katsutoshi Kanamori, Hayato Ohwada:
Gene Selection from Microarray Data for Alzheimer's Disease Using Random Forest. Int. J. Softw. Sci. Comput. Intell. 9(2): 14-30 (2017) - 2016
- [j2]Sho Ushikubo, Katsutoshi Kanamori, Hayato Ohwada:
Extracting Rules for Decreasing Body Fat Mass Using Various Classifiers from Daily Lifestyle Habits Data. Int. J. Softw. Sci. Comput. Intell. 8(3): 54-70 (2016) - [c12]Sho Ushikubo, Katsutoshi Kanamori, Hayato Ohwada:
Extracting time-oriented relationships of nutrients to losing body fat mass using inductive logic programming. ICCI*CC 2016: 226-230 - [c11]Kazutaka Nishiwaki, Katsutoshi Kanamori, Hayato Ohwada:
Finding a disease-related gene from microarray data using random forest. ICCI*CC 2016: 542-546 - [c10]Shinji Hayashi, Niken Prasasti
, Katsutoshi Kanamori, Hayato Ohwada:
Improving Behavior Prediction Accuracy by Using Machine Learning for Agent-Based Simulation. ACIIDS (1) 2016: 280-289 - [c9]Yu Oya, Katsutoshi Kanamori, Hayato Ohwada:
Recursive Ensemble Land Cover Classification with Little Training Data and Many Classes. ACIIDS (1) 2016: 521-531 - [c8]Ratna Hidayati, Katsutoshi Kanamori, Ling Feng, Hayato Ohwada:
Implementing Majority Voting Rule to Classify Corporate Value Based on Environmental Efforts. DMBD 2016: 59-66 - [c7]Ratna Hidayati, Katsutoshi Kanamori, Ling Feng, Hayato Ohwada:
Various Classifiers to Investigate the Relationship Between CSR Activities and Corporate Value. IEA/AIE 2016: 23-30 - [c6]Ratna Hidayati, Katsutoshi Kanamori, Ling Feng, Hayato Ohwada:
Combining Feature Selection with Decision Tree Criteria and Neural Network for Corporate Value Classification. PKAW 2016: 31-42 - 2015
- [c5]Atsushi Matsumoto, Katsutoshi Kanamori, Kazuyuki Kuchitsu, Hayato Ohwada:
Extracting the Common Structure of Compounds to Induce Plant Immunity Activation using ILP. ILP (Late Breaking Papers) 2015: 69-78 - 2014
- [j1]Hayato Ohwada, Masato Okada, Katsutoshi Kanamori:
Route-Planning Algorithms for Amusement-Park Navigation. Int. J. Softw. Sci. Comput. Intell. 6(2): 78-92 (2014) - [c4]Niken Prasasti
Customer Lifetime Value and Defection Possibility Prediction Model Using Machine Learning: An Application to a Cloud-Based Software Company. ACIIDS (2) 2014: 62-71 - [c3]Niken Prasasti Martono
Utilizing Customers' Purchase and Contract Renewal Details to Predict Defection in the Cloud Software Industry. PKAW 2014: 138-149 - 2013
- [c2]Hayato Ohwada, Masato Okada, Katsutoshi Kanamori:
Flexible route planning for amusement parks navigation. ICCI*CC 2013: 421-427 - 2012
- [c1]Katsutoshi Kanamori, Hayato Ohwada:
Creative Problem Solving by Concept Generation Using Relation Structure. ILP (Late Breaking Papers) 2012: 44-49
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: