default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMasaru Shimbo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[j18]Naoto Abe, Mineichi Kudo
, Jun Toyama, Masaru Shimbo:
Classifier-independent feature selection on the basis of divergence criterion. Pattern Anal. Appl. 9(2-3): 127-137 (2006)- 2003
- [j17]Mineichi Kudo, Naoto Masuyama, Jun Toyama, Masaru Shimbo:
Simple termination conditions for k-nearest neighbor method. Pattern Recognit. Lett. 24(9-10): 1203-1213 (2003) - 2002
- [c26]Naoto Abe, Mineichi Kudo, Masaru Shimbo:
Classifier-Independent Feature Selection Based on Non-parametric Discriminant Analysis. SSPR/SPR 2002: 470-479 - 2001
- [j16]Hiroki Hayashi, Mineichi Kudo, Jun Toyama, Masaru Shimbo:
Fast Labelling of Natural Scenes Using Enhanced Knowledge. Pattern Anal. Appl. 4(1): 20-27 (2001) - [j15]Yoshinori Yanagihara, Masanori Kawakami, Mineichi Kudo, Jun Toyama, Masaru Shimbo:
A two-channel coding of images using spline surfaces. Syst. Comput. Jpn. 32(6): 13-20 (2001) - 2000
- [c25]Mineichi Kudo, Hideyuki Imai, Masaru Shimbo:
A Histogram-Based Classifier on Overlapped Bins. ICPR 2000: 2029-2033 - [c24]Yoshiroh Itoh, Jun Toyama, Masaru Shimbo:
Speaker feature extraction from pitch information based on spectral subtraction for speaker identification. INTERSPEECH 2000: 310-313 - [c23]Jun Toyama, Masaru Shimbo:
Syllable recognition using glides based on a non-linear transformation. INTERSPEECH 2000: 321-324 - [c22]Germano Resconi, Tetsuya Murai, Michinori Nakata, Masaru Shimbo:
Semantic field: introduction. KES 2000: 483-486 - [c21]Tetsuya Murai, Germano Resconi, Masaru Shimbo:
Degrees of significance and generation of an accessibility relation. KES 2000: 487-490 - [c20]Germano Resconi, T. Mura, Masaru Shimbo:
Semantic field and accessibility relations. KES 2000: 491-494 - [c19]Germano Resconi, Tetsuya Murai, Masaru Shimbo:
Uncertainty and the semantic field. KES 2000: 581-584 - [c18]Hiroshi Tenmoto, Mineichi Kudo, Masaru Shimbo:
Selection of the Number of Components Using a Genetic Algorithm for Mixture Model Classifiers. SSPR/SPR 2000: 511-520 - [c17]Naoto Abe, Mineichi Kudo, Jun Toyama, Masaru Shimbo:
A Divergence Criterion for Classifier-Independent Feature Selection. SSPR/SPR 2000: 668-676 - [c16]Mineichi Kudo, Petr Somol, Pavel Pudil, Masaru Shimbo, Jack Sklansky:
Comparison of Classifier-Specific Feature Selection Algorithms. SSPR/SPR 2000: 677-686
1990 – 1999
- 1999
- [j14]Mineichi Kudo, Jun Toyama, Masaru Shimbo:
Multidimensional curve classification using passing-through regions. Pattern Recognit. Lett. 20(11-13): 1103-1111 (1999) - [c15]Hiroshi Tenmoto, Mineichi Kudo, Masaru Shimbo:
Determination of the number of components based on class separability in mixture-based classifiers. KES 1999: 439-442 - [c14]Naoto Masuyama, Mineichi Kudo, Jun Toyama, Masaru Shimbo:
Termination conditions for a fast k-nearest neighbor method. KES 1999: 443-446 - [c13]Hiroki Hayashi, Mineichi Kudo, Jun Toyama, Masaru Shimbo:
Estimation of velocity vectors from a video stream using discontinuity of optical flow. KES 1999: 447-450 - [c12]Masanori Kawakami, Mineichi Kudo, Jun Toyama, Masaru Shimbo:
Effective sampling points for two-channel spline image coding. KES 1999: 451-454 - [c11]Tomohiko Gotoh, Mineichi Kudo, Jun Toyama, Masaru Shimbo:
Geometry reconstruction of urban scenes by tracking vertical edges. KES 1999: 455-458 - [c10]J. Konishi, S. Shimba, Jun Toyama, Mineichi Kudo, Masaru Shimbo:
Tabu search for solving optimization problems on Hopfield neural networks. KES 1999: 518-521 - 1998
- [j13]Tetsuya Murai, Hideo Kanemitsu, Masaru Shimbo:
Fuzzy Sets and Binary-Proximity-Based Rough Sets. Inf. Sci. 104(1-2): 49-80 (1998) - [j12]Manabu Sato, Mineichi Kudo, Jun Toyama, Masaru Shimbo:
Construction of nonlinear discrimination function based on the MDL criterion. Kybernetika 34(4): 467-472 (1998) - [j11]Hiroshi Tenmoto, Mineichi Kudo, Masaru Shimbo:
Piecewise linear classifiers preserving high local recognition rates. Kybernetika 34(4): 479-484 (1998) - [j10]Hiroshi Tenmoto, Mineichi Kudo, Masaru Shimbo:
Piecewise linear classifiers with an appropriate number of hyperplanes. Pattern Recognit. 31(11): 1627-1634 (1998) - [j9]Mineichi Kudo, Yoichiro Torii, Yasukuni Mori, Masaru Shimbo:
Approximation of class regions by quasi convex hulls. Pattern Recognit. Lett. 19(9): 777-786 (1998) - [c9]Mineichi Kudo, Hiroshi Tenmoto, Satoru Sumiyoshi, Masaru Shimbo:
A subclass-based mixture model for pattern recognition. ICPR 1998: 870-872 - [c8]Yasukuni Mori, Mineichi Kudo, Jun Toyama, Masaru Shimbo:
Visualization of the structure of classes using a graph. ICPR 1998: 1724-1727 - [c7]Mineichi Kudo, F. Taniguchi, Hiroshi Tenmoto, Masaru Shimbo:
Appropriate initial component densities of mixture modeling for pattern recognition. KES (2) 1998: 216-220 - [c6]Shinichi Yanagi, Mineichi Kudo, Masaru Shimbo:
Polynomial-sample learnability about distance-0 and 1 DNF formulas. KES (2) 1998: 230-235 - [c5]Tetsuya Murai, Michinori Nakata, Masaru Shimbo:
Generation of accessible worlds under available information. KES (2) 1998: 236-242 - [c4]Maiko Sato, Mineichi Kudo, Jun Toyama, Masaru Shimbo:
Feature Selection For a Nonlinear Classifier. SSPR/SPR 1998: 555-563 - [c3]Hiroshi Tenmoto, Mineichi Kudo, Masaru Shimbo:
MDL-Based Selection of the Number of Components in Mixture Models for Pattern Classification. SSPR/SPR 1998: 831-836 - 1997
- [c2]F. Taniguchi, Mineichi Kudo, Masaru Shimbo:
Estimation of class regions in feature space using rough set theory. KES (2) 1997: 373-377 - 1996
- [j8]Mineichi Kudo, Shinichi Yanagi, Masaru Shimbo:
Construction of class regions by a randomized algorithm: a randomized subclass method. Pattern Recognit. 29(4): 581-588 (1996) - [j7]Mineichi Kudo, Koji Mizukami, Yuji Nakamura, Masaru Shimbo:
Realization of membership quiries in character recognition. Pattern Recognit. Lett. 17(1): 77-82 (1996) - [c1]Mineichi Kudo, Masaru Shimbo:
Selection of classifiers based on the MDL principle using the VC dimension. ICPR 1996: 886-890 - 1993
- [j6]Mineichi Kudo, Masaru Shimbo:
Feature selection based on the structural indices of categories. Pattern Recognit. 26(6): 891-901 (1993) - 1992
- [j5]Mineichi Kudo, S. Kitamura-Abe, Masaru Shimbo, Y. Lida:
Analysis of context of 5'-splice site sequences in mammalian mRNA precursors by subclass method. Comput. Appl. Biosci. 8(4): 367-376 (1992)
1980 – 1989
- 1989
- [j4]Mineichi Kudo, Masaru Shimbo:
Optimal subclasses with dichotomous variables for feature selection and discrimination. IEEE Trans. Syst. Man Cybern. 19(5): 1194-1198 (1989) - 1988
- [j3]Tetsuya Murai, Masaaki Miyakoshi, Masaru Shimbo:
A modeling of search oriented thesaurus use based on multivalued logical inference. Inf. Sci. 45(2): 185-212 (1988) - [j2]Mineichi Kudo, Masaru Shimbo:
Efficient regular grammatical inference techniques by the use of partial similarities and their logical relationships. Pattern Recognit. 21(4): 401-409 (1988) - 1987
- [j1]Mineichi Kudo, Y. Iida, Masaru Shimbo:
Syntactic pattern analysis of 5'-splice site sequences of mRNA precursors in higher eukaryote genes. Comput. Appl. Biosci. 3(4): 319-324 (1987)
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-24 22:45 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:
