2008 |
63 | EE | Aurelie C. Lozano,
Naoki Abe:
Multi-class cost-sensitive boosting with p-norm loss functions.
KDD 2008: 506-514 |
2007 |
62 | EE | Andrew Arnold,
Yan Liu,
Naoki Abe:
Temporal causal modeling with graphical granger methods.
KDD 2007: 66-75 |
61 | EE | Hiroshi Mamitsuka,
Naoki Abe:
Active ensemble learning: Application to data mining and bioinformatics.
Systems and Computers in Japan 38(11): 100-108 (2007) |
2006 |
60 | EE | Bishwaranjan Bhattacharjee,
Naoki Abe,
Kenneth Goldman,
Bianca Zadrozny,
Vamsavardhana R. Chillakuru,
Marysabel del Carpio,
Chidanand Apté:
Using secure coprocessors for privacy preserving collaborative data mining and analysis.
DaMoN 2006: 1 |
59 | EE | Hisashi Kashima,
Naoki Abe:
A Parameterized Probabilistic Model of Network Evolution for Supervised Link Prediction.
ICDM 2006: 340-349 |
58 | EE | Naoki Abe,
Bianca Zadrozny,
John Langford:
Outlier detection by active learning.
KDD 2006: 504-509 |
2005 |
57 | EE | Markus Ettl,
Bianca Zadrozny,
Pawan Chowdhary,
Naoki Abe:
Business Performance Management System for CRM and Sales Execution.
DEXA Workshops 2005: 908-913 |
56 | EE | Atsuyoshi Nakamura,
Naoki Abe:
Improvements to the Linear Programming Based Scheduling of Web Advertisements.
Electronic Commerce Research 5(1): 75-98 (2005) |
2004 |
55 | EE | Naoki Abe,
Bianca Zadrozny,
John Langford:
An iterative method for multi-class cost-sensitive learning.
KDD 2004: 3-11 |
54 | EE | Naoki Abe,
Naval K. Verma,
Chidanand Apté,
Robert Schroko:
Cross channel optimized marketing by reinforcement learning.
KDD 2004: 767-772 |
53 | EE | Naoki Abe,
Roni Khardon:
Foreword.
Theor. Comput. Sci. 313(2): 173-174 (2004) |
2003 |
52 | EE | Bianca Zadrozny,
John Langford,
Naoki Abe:
Cost-Sensitive Learning by Cost-Proportionate Example Weighting.
ICDM 2003: 435- |
51 | EE | Naoki Abe,
Alan W. Biermann,
Philip M. Long:
Reinforcement Learning with Immediate Rewards and Linear Hypotheses.
Algorithmica 37(4): 263-293 (2003) |
2002 |
50 | EE | Naoki Abe,
Edwin P. D. Pednault,
Haixun Wang,
Bianca Zadrozny,
Wei Fan,
Chidanand Apté:
Empirical Comparison of Various Reinforcement Learning Strategies for Sequential Targeted Marketing.
ICDM 2002: 3-10 |
49 | EE | Edwin P. D. Pednault,
Naoki Abe,
Bianca Zadrozny:
Sequential cost-sensitive decision making with reinforcement learning.
KDD 2002: 259-268 |
48 | EE | Hiroshi Mamitsuka,
Naoki Abe:
Efficient Data Mining by Active Learning.
Progress in Discovery Science 2002: 258-267 |
47 | 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) |
2001 |
46 | | Naoki Abe,
Roni Khardon,
Thomas Zeugmann:
Algorithmic Learning Theory, 12th International Conference, ALT 2001, Washington, DC, USA, November 25-28, 2001, Proceedings
Springer 2001 |
45 | EE | Naoki Abe,
Roni Khardon,
Thomas Zeugmann:
Editors' Introduction.
ALT 2001: 1-8 |
2000 |
44 | EE | Atsuyoshi Nakamura,
Naoki Abe,
Hiroshi Matoba,
Katsuhiro Ochiai:
Automatic recording agent for digital video server.
ACM Multimedia 2000: 57-66 |
43 | | Hiroshi Mamitsuka,
Naoki Abe:
Efficient Mining from Large Databases by Query Learning.
ICML 2000: 575-582 |
42 | EE | Naoki Abe,
Tomonari Kamba:
A Web marketing system with automatic pricing.
Computer Networks 33(1-6): 775-788 (2000) |
41 | | Jun-ichi Takeuchi,
Naoki Abe,
Shun-ichi Amari:
The Lob-Pass Problem.
J. Comput. Syst. Sci. 61(3): 523-557 (2000) |
1999 |
40 | | Naoki Abe,
Atsuyoshi Nakamura:
Learning to Optimally Schedule Internet Banner Advertisements.
ICML 1999: 12-21 |
39 | | Naoki Abe,
Philip M. Long:
Associative Reinforcement Learning using Linear Probabilistic Concepts.
ICML 1999: 3-11 |
38 | | Hang Li,
Naoki Abe:
Learning Dependencies between Case Frame Slots.
Computational Linguistics 25(2): 283-291 (1999) |
37 | 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 |
36 | | Hang Li,
Naoki Abe:
Word Clustering and Disambiguation Based on Co-occurence Data.
COLING-ACL 1998: 749-755 |
35 | EE | Naoki Abe,
Hiroshi Mamitsuka,
Atsuyoshi Nakamura:
Empirical Comparison of Competing Query Learning Methods.
Discovery Science 1998: 387-388 |
34 | | Naoki Abe,
Hiroshi Mamitsuka:
Query Learning Strategies Using Boosting and Bagging.
ICML 1998: 1-9 |
33 | | Atsuyoshi Nakamura,
Naoki Abe:
Collaborative Filtering Using Weighted Majority Prediction Algorithms.
ICML 1998: 395-403 |
32 | | 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) |
31 | EE | Hang Li,
Naoki Abe:
Word Clustering and Disambiguation Based on Co-occurrence Data
CoRR cmp-lg/9807004: (1998) |
30 | | Hang Li,
Naoki Abe:
Generalizing Case Frames Using a Thesaurus and the MDL Principle.
Computational Linguistics 24(2): 217-244 (1998) |
1997 |
29 | | Naoki Abe,
Hiroshi Mamitsuka:
Predicting Protein Secondary Structure Using Stochastic Tree Grammars.
Machine Learning 29(2-3): 275-301 (1997) |
28 | | Naoki Abe:
Towards Realistic Theories of Learning.
New Generation Comput. 15(1): 3-25 (1997) |
1996 |
27 | EE | Hang Li,
Naoki Abe:
Learning Dependencies between Case Frame Slots.
COLING 1996: 10-15 |
26 | EE | Hang Li,
Naoki Abe:
Clustering Words with the MDL Principle.
COLING 1996: 4-9 |
25 | | Naoki Abe,
Hang Li:
Learning Word Association Norms Using Tree Cut Pair Models.
ICML 1996: 3-11 |
24 | EE | Hang Li,
Naoki Abe:
Learning Dependencies between Case Frame Slots
CoRR cmp-lg/9605013: (1996) |
23 | EE | Hang Li,
Naoki Abe:
Clustering Words with the MDL Principle
CoRR cmp-lg/9605014: (1996) |
22 | EE | Naoki Abe,
Hang Li:
Learning Word Association Norms Using Tree Cut Pair Models
CoRR cmp-lg/9605029: (1996) |
1995 |
21 | EE | Atsuyoshi Nakamura,
Naoki Abe:
On-line Learning of Binary and n-ary Relations over Multi-dimensional Clusters.
COLT 1995: 214-221 |
20 | | Naoki Abe,
Hang Li,
Atsuyoshi Nakamura:
On-line Learning of Binary Lexical Relations Using Two-dimensional Weighted Majority Algorithms.
ICML 1995: 3-11 |
19 | 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) |
18 | EE | Hang Li,
Naoki Abe:
Generalizing Case Frames Using a Thesaurus and the MDL Principle
CoRR abs/cmp-lg/9507011: (1995) |
17 | | Naoki Abe:
Characterizing PAC-Learnability of Semilinear Sets
Inf. Comput. 116(1): 81-102 (1995) |
16 | 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 |
15 | | Naoki Abe:
Towards Realistic Theories of Learning.
AII/ALT 1994: 187-209 |
14 | | Atsuyoshi Nakamura,
Naoki Abe,
Jun-ichi Takeuchi:
Efficient Distribution-free Population Learning of Simple Concepts.
AII/ALT 1994: 500-515 |
13 | | Naoki Abe,
Hiroshi Mamitsuka:
A New Method for Predicting Protein Secondary Structures Based on Stochastic Tree Grammars.
ICML 1994: 3-11 |
12 | | Hiroshi Mamitsuka,
Naoki Abe:
Predicting Location and Structure Of beta-Sheet Regions Using Stochastic Tree Grammars.
ISMB 1994: 276-284 |
1993 |
11 | | Atsuyoshi Nakamura,
Naoki Abe:
Exact Learning of Linear Combinations of Monotone Terms from Function Value Queries.
ALT 1993: 300-313 |
10 | EE | Naoki Abe,
Jun-ichi Takeuchi:
The "lob-pass" Problem and an On-line Learning Model of Rational Choice.
COLT 1993: 422-428 |
1992 |
9 | | Naoki Abe,
Manfred K. Warmuth:
On the Computational Complexity of Approximating Distributions by Probabilistic Automata.
Machine Learning 9: 205-260 (1992) |
1991 |
8 | EE | Naoki Abe,
Manfred K. Warmuth,
Jun-ichi Takeuchi:
Polynomial Learnability of Probabilistic Concepts with Respect to the Kullback-Leibler Divergence.
COLT 1991: 277-289 |
7 | | Naoki Abe:
On the Sample Complexity of Various Learning Strategies in the Probabilistic PAC Learning Paradigms.
Nonmonotonic and Inductive Logic 1991: 89-106 |
6 | | Naoki Abe:
Learning Commutative Deterministic Finite State Automata in Polynomial Time.
New Generation Comput. 8(4): 319- (1991) |
1990 |
5 | | Naoki Abe:
Learning Commutative Deterministic Finite State Automata in Polynomial Time.
ALT 1990: 223-235 |
4 | EE | Naoki Abe,
Manfred K. Warmuth:
On the Computational Complexity of Approximating Distributions by Probabilistic Automata.
COLT 1990: 52-66 |
1989 |
3 | EE | Naoki Abe:
Polynomial Learnability of Semilinear Sets.
COLT 1989: 25-40 |
1988 |
2 | | Naoki Abe:
Polynominal Learnability and Locality of Formal Grammars.
ACL 1988: 225-232 |
1 | | Naoki Abe:
Feasible learnability of formal grammars and the theory of natural language acquisition.
COLING 1988: 1-6 |