#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1973

2013

- This year (0)
- Last 5 years (2)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Eiji Takimoto, Akira Maruoka, Vladimir Vovk
- Machine Learning
- 1995

Many algorithms for inferring a decision tree from data involve a two-phase process: First, a very large decision tree is grown which typically ends up “over-fitting” the data. To reduce over-fitting, in the second phase, the tree is pruned using one of a number of available methods. The final tree is then output and used for classification on test data. In… (More)

- Shuji Jimbo, Akira Maruoka
- Combinatorica
- 1987

Since Razborov, based on the approximation method, succeeded to obtain a superpolynomial lower bound on the size of monotone circuits computing the clique function, much effort has been devoted to explore the method and derive good lower bounds[K, NM, R1, R2, RR]. Employing the approximation method, Alon and Boppana[AB] obtained an exponential lower bound… (More)

- Shuji Jimbo, Akira Maruoka
- SIAM J. Comput.
- 1996

A classifier with n inputs is a comparator network that classifies a set of n values into two classes with the same number of values in such a way that each value in one class is at least as large as all of those in the other. Based on the utilization of expanders, Pippenger constructed classifiers with n inputs whose size is asymptotic to 2n log n. In the… (More)

- Kazuyuki Amano, Akira Maruoka
- SIAM J. Comput.
- 1998

- Akira Maruoka, Masayuki Kimura
- Information and Control
- 1976

- Akira Maruoka, Masayuki Kimura
- J. Comput. Syst. Sci.
- 1979

- Eiji Takimoto, Akira Maruoka
- Theor. Comput. Sci.
- 2003

- Kazuyuki Amano, Akira Maruoka
- MFCS
- 2005

- Kazuyuki Amano, Akira Maruoka
- ALT
- 2002