Data and Knowledge Engineering, 12, 83--99. Mannila, H., & Toivonen, H. (1996). On an algorithm for finding all interesting sentences. In R. Trappl (Ed.), Cybernetics and Systems `96 (EMCSR 1996), (pp. 973--978). Vienna: Austrian Society for Cybernetic Studies.

 Home/Search   Document Not in Database   Summary   Related Articles  

This paper is cited in the following contexts:
A Multistrategy Approach to Relational Knowledge Discovery.. - Morik, Brockhausen (1996)   (2 citations)  (Correct)

....user in our framework does not need to implement the interaction between the learning result of one algorithm and its impact on the other algorithm. This is particularly different from the Kepler KDD workbench, which offers a variety of learning algorithms together with a set oriented layer for data management (Wrobel et al. 1996). Kepler allows the user to call various learning tools and use the results of one as input to another one. It is a loosely coupled system, whereas ours is a tightly coupled one. For the purpose of directly accessing database management systems, Rdt was enhanced so that hypothesis testing is ....

Data and Knowledge Engineering, 12, 83--99. Mannila, H., & Toivonen, H. (1996). On an algorithm for finding all interesting sentences. In R. Trappl (Ed.), Cybernetics and Systems `96 (EMCSR 1996), (pp. 973--978). Vienna: Austrian Society for Cybernetic Studies.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC