2008 |
40 | EE | Atsuyoshi Nakamura,
Mineichi Kudo:
What Sperner Family Concept Class is Easy to Be Enumerated?
ICDM 2008: 482-491 |
39 | EE | Yohji Shidara,
Mineichi Kudo,
Atsuyoshi Nakamura:
Classification by bagged consistent itemset rules.
ICPR 2008: 1-4 |
38 | EE | Mineichi Kudo,
Atsuyoshi Nakamura,
Ichigaku Takigawa:
Classification by reflective convex hulls.
ICPR 2008: 1-4 |
37 | EE | Satoshi Shirai,
Mineichi Kudo,
Atsuyoshi Nakamura:
Bagging, Random Subspace Method and Biding.
SSPR/SPR 2008: 801-810 |
36 | EE | Yohji Shidara,
Mineichi Kudo,
Atsuyoshi Nakamura:
Classification Based on Consistent Itemset Rules.
Trans. MLDM 1(1): 17-30 (2008) |
2007 |
35 | EE | Hisashi Tosaka,
Atsuyoshi Nakamura,
Mineichi Kudo:
Mining Subtrees with Frequent Occurrence of Similar Subtrees.
Discovery Science 2007: 286-290 |
34 | EE | Yohji Shidara,
Atsuyoshi Nakamura,
Mineichi Kudo:
CCIC: Consistent Common Itemsets Classifier.
MLDM 2007: 490-498 |
2006 |
33 | EE | Atsuyoshi Nakamura:
Learning-Related Complexity of Linear Ranking Functions.
ALT 2006: 378-392 |
2005 |
32 | EE | Hidehiko Ino,
Mineichi Kudo,
Atsuyoshi Nakamura:
A Comparative Study of Algorithms for Finding Web Communities.
ICDE Workshops 2005: 1257 |
31 | EE | Hiroyuki Hasegawa,
Mineichi Kudo,
Atsuyoshi Nakamura:
Empirical Study on Usefulness of Algorithm SACwRApper for Reputation Extraction from the WWW.
KES (4) 2005: 668-674 |
30 | EE | Ichigaku Takigawa,
Mineichi Kudo,
Atsuyoshi Nakamura:
The Convex Subclass Method: Combinatorial Classifier Based on a Family of Convex Sets.
MLDM 2005: 90-99 |
29 | EE | Atsuyoshi Nakamura,
Mineichi Kudo:
Mining Frequent Trees with Node-Inclusion Constraints.
PAKDD 2005: 850-860 |
28 | EE | Hidehiko Ino,
Mineichi Kudo,
Atsuyoshi Nakamura:
Partitioning of Web graphs by community topology.
WWW 2005: 661-669 |
27 | EE | Yohji Shidara,
Mineichi Kudo,
Atsuyoshi Nakamura:
Extraction of Generalized Rules with Automated Attribute Abstraction.
Foundations of Data Mining and knowledge Discovery 2005: 161-170 |
26 | EE | Atsuyoshi Nakamura,
Naoki Abe:
Improvements to the Linear Programming Based Scheduling of Web Advertisements.
Electronic Commerce Research 5(1): 75-98 (2005) |
25 | EE | Atsuyoshi Nakamura:
An efficient query learning algorithm for ordered binary decision diagrams.
Inf. Comput. 201(2): 178-198 (2005) |
24 | EE | Atsuyoshi Nakamura,
Michael Schmitt,
Niels Schmitt,
Hans-Ulrich Simon:
Inner Product Spaces for Bayesian Networks.
Journal of Machine Learning Research 6: 1383-1403 (2005) |
2004 |
23 | EE | Atsuyoshi Nakamura,
Michael Schmitt,
Niels Schmitt,
Hans-Ulrich Simon:
Bayesian Networks and Inner Product Spaces.
COLT 2004: 518-533 |
22 | EE | Ichigaku Takigawa,
Mineichi Kudo,
Atsuyoshi Nakamura,
Jun Toyama:
On the Minimum l1-Norm Signal Recovery in Underdetermined Source Separation.
ICA 2004: 193-200 |
2003 |
21 | EE | Atsuyoshi Nakamura,
Mineichi Kudo,
Akira Tanaka,
Kazuhiko Tanabe:
Collaborative Filtering Using Projective Restoration Operators.
Discovery Science 2003: 393-401 |
20 | EE | Atsuyoshi Nakamura,
Mineichi Kudo,
Akira Tanaka:
Collaborative Filtering Using Restoration Operators.
PKDD 2003: 339-349 |
2002 |
19 | EE | Atsuyoshi Nakamura:
Improvements in practical aspects of optimally scheduling web advertising.
WWW 2002: 536-541 |
18 | EE | Atsuyoshi Nakamura,
Naoki Abe:
Online Learning of Binary and n-ary Relations over Clustered Domains.
J. Comput. Syst. Sci. 65(2): 224-256 (2002) |
2000 |
17 | EE | Atsuyoshi Nakamura,
Naoki Abe,
Hiroshi Matoba,
Katsuhiro Ochiai:
Automatic recording agent for digital video server.
ACM Multimedia 2000: 57-66 |
16 | EE | Atsuyoshi Nakamura:
Query learning of bounded-width OBDDs.
Theor. Comput. Sci. 241(1-2): 83-114 (2000) |
1999 |
15 | EE | Atsuyoshi Nakamura:
Learning Specialist Decision Lists.
COLT 1999: 215-225 |
14 | | Naoki Abe,
Atsuyoshi Nakamura:
Learning to Optimally Schedule Internet Banner Advertisements.
ICML 1999: 12-21 |
13 | EE | Marc Langheinrich,
Atsuyoshi Nakamura,
Naoki Abe,
Tomonari Kamba,
Yoshiyuki Koseki:
Unintrusive Customization Techniques for Web Advertising.
Computer Networks 31(11-16): 1259-1272 (1999) |
1998 |
12 | EE | Naoki Abe,
Hiroshi Mamitsuka,
Atsuyoshi Nakamura:
Empirical Comparison of Competing Query Learning Methods.
Discovery Science 1998: 387-388 |
11 | | Atsuyoshi Nakamura,
Naoki Abe:
Collaborative Filtering Using Weighted Majority Prediction Algorithms.
ICML 1998: 395-403 |
10 | | Atsuyoshi Nakamura,
Jun-ichi Takeuchi,
Naoki Abe:
Efficient Distribution-Free Population Learning of Simple Concepts.
Ann. Math. Artif. Intell. 23(1-2): 53-82 (1998) |
1997 |
9 | | Atsuyoshi Nakamura:
An Efficient Exact Learning Algorithm for Ordered Binary Decision Diagrams.
ALT 1997: 307-322 |
1996 |
8 | | Atsuyoshi Nakamura:
Query Learning of Bounded-Width OBDDs.
ALT 1996: 37-50 |
1995 |
7 | | Atsuyoshi Nakamura,
Shinji Miura:
Learning Sparse Linear Combinations of Basis Functions over a Finite Domain.
ALT 1995: 138-150 |
6 | EE | Atsuyoshi Nakamura,
Naoki Abe:
On-line Learning of Binary and n-ary Relations over Multi-dimensional Clusters.
COLT 1995: 214-221 |
5 | | Naoki Abe,
Hang Li,
Atsuyoshi Nakamura:
On-line Learning of Binary Lexical Relations Using Two-dimensional Weighted Majority Algorithms.
ICML 1995: 3-11 |
4 | EE | Naoki Abe,
Hang Li,
Atsuyoshi Nakamura:
On-line Learning of Binary Lexical Relations Using Two-dimensional Weighted Majority Algorithms
CoRR abs/cmp-lg/9507010: (1995) |
3 | EE | Atsuyoshi Nakamura,
Naoki Abe:
Exact Learning of Linear Combinations of Monotone Terms from Function Value Queries.
Theor. Comput. Sci. 137(1): 159-176 (1995) |
1994 |
2 | | Atsuyoshi Nakamura,
Naoki Abe,
Jun-ichi Takeuchi:
Efficient Distribution-free Population Learning of Simple Concepts.
AII/ALT 1994: 500-515 |
1993 |
1 | | Atsuyoshi Nakamura,
Naoki Abe:
Exact Learning of Linear Combinations of Monotone Terms from Function Value Queries.
ALT 1993: 300-313 |