![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Jun Sese 4 Jun Sese, Shinichi Morishita : Answering the Most Correlated N Association Rules Efficiently. PKDD 2002 : 410-422 3 Jie Cheng , Christor Hatzis , Hisashi Hayashi , Mark-A. Krogel , Shinichi Morishita , David Page , Jun Sese: KDD Cup 2001 Report. SIGKDD Explorations 3 (2): 47-64 (2002) 2 Shinichi Morishita , Jun Sese: Traversing Itemset Lattice with Statistical Metric Pruning. PODS 2000 : 226-236 1 Junichi Akita , Jun Sese, Tochihide Saka , Masahiro Aono , Tomomi Kawarabayashi , Junji Nishino : Linked99. RoboCup 1999 : 671-674 ![]() DiSC'03 © 2003 Association for Computing Machinery |