The SCEAS System
| |||||||

## Search the dblp DataBase
Atsuyoshi Nakamura:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Atsuyoshi Nakamura
**Learning-Related Complexity of Linear Ranking Functions.**[Citation Graph (0, 0)][DBLP] ALT, 2006, pp:378-392 [Conf] - Atsuyoshi Nakamura
**Query Learning of Bounded-Width OBDDs.**[Citation Graph (0, 0)][DBLP] ALT, 1996, pp:37-50 [Conf] - Atsuyoshi Nakamura
**An Efficient Exact Learning Algorithm for Ordered Binary Decision Diagrams.**[Citation Graph (0, 0)][DBLP] ALT, 1997, pp:307-322 [Conf] - Atsuyoshi Nakamura, Naoki Abe
**Exact Learning of Linear Combinations of Monotone Terms from Function Value Queries.**[Citation Graph (0, 0)][DBLP] ALT, 1993, pp:300-313 [Conf] - Atsuyoshi Nakamura, Naoki Abe, Jun-ichi Takeuchi
**Efficient Distribution-free Population Learning of Simple Concepts.**[Citation Graph (0, 0)][DBLP] AII/ALT, 1994, pp:500-515 [Conf] - Atsuyoshi Nakamura, Shinji Miura
**Learning Sparse Linear Combinations of Basis Functions over a Finite Domain.**[Citation Graph (0, 0)][DBLP] ALT, 1995, pp:138-150 [Conf] - Atsuyoshi Nakamura
**Learning Specialist Decision Lists.**[Citation Graph (0, 0)][DBLP] COLT, 1999, pp:215-225 [Conf] - Atsuyoshi Nakamura, Naoki Abe
**On-line Learning of Binary and**[Citation Graph (0, 0)][DBLP]*n*-ary Relations over Multi-dimensional Clusters. COLT, 1995, pp:214-221 [Conf] - Atsuyoshi Nakamura, Michael Schmitt, Niels Schmitt, Hans-Ulrich Simon
**Bayesian Networks and Inner Product Spaces.**[Citation Graph (0, 0)][DBLP] COLT, 2004, pp:518-533 [Conf] - Naoki Abe, Hiroshi Mamitsuka, Atsuyoshi Nakamura
**Empirical Comparison of Competing Query Learning Methods.**[Citation Graph (0, 0)][DBLP] Discovery Science, 1998, pp:387-388 [Conf] - Atsuyoshi Nakamura, Mineichi Kudo, Akira Tanaka, Kazuhiko Tanabe
**Collaborative Filtering Using Projective Restoration Operators.**[Citation Graph (0, 0)][DBLP] Discovery Science, 2003, pp:393-401 [Conf] - Ichigaku Takigawa, Mineichi Kudo, Atsuyoshi Nakamura, Jun Toyama
**On the Minimum l**[Citation Graph (0, 0)][DBLP]_{1}-Norm Signal Recovery in Underdetermined Source Separation. ICA, 2004, pp:193-200 [Conf] - Hidehiko Ino, Mineichi Kudo, Atsuyoshi Nakamura
**A Comparative Study of Algorithms for Finding Web Communities.**[Citation Graph (0, 0)][DBLP] ICDE Workshops, 2005, pp:1257- [Conf] - Naoki Abe, Hang Li, Atsuyoshi Nakamura
**On-line Learning of Binary Lexical Relations Using Two-dimensional Weighted Majority Algorithms.**[Citation Graph (0, 0)][DBLP] ICML, 1995, pp:3-11 [Conf] - Naoki Abe, Atsuyoshi Nakamura
**Learning to Optimally Schedule Internet Banner Advertisements.**[Citation Graph (0, 0)][DBLP] ICML, 1999, pp:12-21 [Conf] - Atsuyoshi Nakamura, Naoki Abe
**Collaborative Filtering Using Weighted Majority Prediction Algorithms.**[Citation Graph (0, 0)][DBLP] ICML, 1998, pp:395-403 [Conf] - Hiroyuki Hasegawa, Mineichi Kudo, Atsuyoshi Nakamura
**Empirical Study on Usefulness of Algorithm SACwRApper for Reputation Extraction from the WWW.**[Citation Graph (0, 0)][DBLP] KES (4), 2005, pp:668-674 [Conf] - Ichigaku Takigawa, Mineichi Kudo, Atsuyoshi Nakamura
**The Convex Subclass Method: Combinatorial Classifier Based on a Family of Convex Sets.**[Citation Graph (0, 0)][DBLP] MLDM, 2005, pp:90-99 [Conf] - Atsuyoshi Nakamura, Naoki Abe, Hiroshi Matoba, Katsuhiro Ochiai
**Automatic recording agent for digital video server.**[Citation Graph (0, 0)][DBLP] ACM Multimedia, 2000, pp:57-66 [Conf] - Atsuyoshi Nakamura, Mineichi Kudo
**Mining Frequent Trees with Node-Inclusion Constraints.**[Citation Graph (0, 0)][DBLP] PAKDD, 2005, pp:850-860 [Conf] - Atsuyoshi Nakamura, Mineichi Kudo, Akira Tanaka
**Collaborative Filtering Using Restoration Operators.**[Citation Graph (0, 0)][DBLP] PKDD, 2003, pp:339-349 [Conf] - Hidehiko Ino, Mineichi Kudo, Atsuyoshi Nakamura
**Partitioning of Web graphs by community topology.**[Citation Graph (0, 0)][DBLP] WWW, 2005, pp:661-669 [Conf] - Atsuyoshi Nakamura
**Improvements in practical aspects of optimally scheduling web advertising.**[Citation Graph (0, 0)][DBLP] WWW, 2002, pp:536-541 [Conf] - Atsuyoshi Nakamura, Jun-ichi Takeuchi, Naoki Abe
**Efficient Distribution-Free Population Learning of Simple Concepts.**[Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 1998, v:23, n:1-2, pp:53-82 [Journal] - Marc Langheinrich, Atsuyoshi Nakamura, Naoki Abe, Tomonari Kamba, Yoshiyuki Koseki
**Unintrusive Customization Techniques for Web Advertising.**[Citation Graph (0, 0)][DBLP] Computer Networks, 1999, v:31, n:11-16, pp:1259-1272 [Journal] - Atsuyoshi Nakamura, Naoki Abe
**Improvements to the Linear Programming Based Scheduling of Web Advertisements.**[Citation Graph (0, 0)][DBLP] Electronic Commerce Research, 2005, v:5, n:1, pp:75-98 [Journal] - Atsuyoshi Nakamura
**An efficient query learning algorithm for ordered binary decision diagrams.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2005, v:201, n:2, pp:178-198 [Journal] - Atsuyoshi Nakamura, Naoki Abe
**Online Learning of Binary and n-ary Relations over Clustered Domains.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2002, v:65, n:2, pp:224-256 [Journal] - Atsuyoshi Nakamura, Michael Schmitt, Niels Schmitt, Hans-Ulrich Simon
**Inner Product Spaces for Bayesian Networks.**[Citation Graph (0, 0)][DBLP] Journal of Machine Learning Research, 2005, v:6, n:, pp:1383-1403 [Journal] - Atsuyoshi Nakamura
**Query learning of bounded-width OBDDs.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2000, v:241, n:1-2, pp:83-114 [Journal] - Atsuyoshi Nakamura, Naoki Abe
**Exact Learning of Linear Combinations of Monotone Terms from Function Value Queries.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1995, v:137, n:1, pp:159-176 [Journal] - Hisashi Tosaka, Atsuyoshi Nakamura, Mineichi Kudo
**Mining Subtrees with Frequent Occurrence of Similar Subtrees.**[Citation Graph (0, 0)][DBLP] Discovery Science, 2007, pp:286-290 [Conf] - Yohji Shidara, Atsuyoshi Nakamura, Mineichi Kudo
**CCIC: Consistent Common Itemsets Classifier.**[Citation Graph (0, 0)][DBLP] MLDM, 2007, pp:490-498 [Conf] **Algorithms for Adversarial Bandit Problems with Multiple Plays.**[Citation Graph (, )][DBLP]**Classifier Selection in a Family of Polyhedron Classifiers.**[Citation Graph (, )][DBLP]**What Sperner Family Concept Class is Easy to Be Enumerated?**[Citation Graph (, )][DBLP]**Classification by bagged consistent itemset rules.**[Citation Graph (, )][DBLP]**Classification by reflective convex hulls.**[Citation Graph (, )][DBLP]**Comparison of Bagging and Boosting Algorithms on Sample and Feature Weighting.**[Citation Graph (, )][DBLP]**Bagging, Random Subspace Method and Biding.**[Citation Graph (, )][DBLP]**On-line Learning of Binary Lexical Relations Using Two-dimensional Weighted Majority Algorithms**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |