![]() ![]() ![]() | ![]() |
|
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Malcolm Potts Naren Ramakrishnan , Deept Kumar , Bud Mishra , Malcolm Potts, Richard F. Helm : Turning CARTwheels: an alternating algorithm for mining redescriptions. KDD 2004 : 266-275 Deept Kumar , Naren Ramakrishnan , Malcolm Potts, Richard F. Helm : Turning CARTwheels: An Alternating Algorithm for Mining Redescriptions CoRR cs.CE/0311048 : (2003) 1 [ 1 ] [ 2 ] 2 [ 1 ] [ 2 ] 3 [ 2 ] 4 [ 1 ] [ 2 ] ![]() ©2005 Association for Computing Machinery |