Welcome to D
SIGMOD 2003
PODS 2003
SIGMOD-RECOR
ADBIS
CIDR 2003
CIKM 2003
DASFAA 2003
Data Enginee
DEBS
DMKD 2003
DOLAP 2003
DPDJ 2003
ER
GIS 2003
Hypertext 20
ICDE 2003
ICDM 2003
ICDT 2003
JCDL 2003
KRDB 2003
MIR 2003
MIS 2003
MMDB 2003
RIDE 2003
SBBD 2003
SIGIR 2003
SIGIR-FORUM
SIGKDD 2003
SIGKDD-EXP
SSDBM 2003
TIME 2003
TODS
VLDB 2003
VLDB Journal
WIDM 2003
About DiSC 2
Editorial Bo
Acknowledgem
DiSC 2004 Pr
ADVIS
DiSC'04 Feed
DiSC'04 Site
Search DiSC'
<<<Author Index>>>
Copyright No

Jun-ichi Takeuchi

Papers on DiSC'04


Distributed cooperative mining for information consortia

Publications


Note: Links lead to the DBLP on the Web.

Jun-ichi Takeuchi

Satoshi Morinaga , Kenji Yamanishi , Jun-ichi Takeuchi: Distributed cooperative mining for information consortia. KDD 2003 : 619-624

Kenji Yamanishi , Jun-ichi Takeuchi: A unifying framework for detecting outliers and change points from non-stationary time series data. KDD 2002 : 676-681

Kenji Yamanishi , Jun-ichi Takeuchi: Discovering outlier filtering rules from unlabeled data: combining a supervised learner with an unsupervised learner. KDD 2001 : 389-394

Kenji Yamanishi , Jun-ichi Takeuchi, Graham J. Williams , Peter Milne : On-line unsupervised outlier detection using finite mixtures with discounting learning algorithms. KDD 2000 : 320-324

Jun-ichi Takeuchi, Naoki Abe , Shun-ichi Amari : The Lob-Pass Problem. J. Comput. Syst. Sci. 61 (3): 523-557 (2000)

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)

Atsuyoshi Nakamura , Naoki Abe , Jun-ichi Takeuchi: Efficient Distribution-free Population Learning of Simple Concepts. AII/ALT 1994 : 500-515

Naoki Abe , Jun-ichi Takeuchi: The "lob-pass" Problem and an On-line Learning Model of Rational Choice. COLT 1993 : 422-428

Jun-ichi Takeuchi: Some Improved Sample Complexity Bounds in the Probabilistic PAC Learning Model. ALT 1992 : 208-219

Naoki Abe , Manfred K. Warmuth , Jun-ichi Takeuchi: Polynomial Learnability of Probabilistic Concepts with Respect to the Kullback-Leibler Divergence. COLT 1991 : 277-289

1 [ 1 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ]

2 [ 6 ]

3 [ 7 ]

4 [ 10 ]

5 [ 4 ] [ 5 ]

6 [ 1 ]

7 [ 7 ]

8 [ 7 ] [ 8 ] [ 9 ] [ 10 ]




©2004 Association for Computing Machinery