M. Klemettinen, H. Mannila, and H. Toivonen. Interactive exploration of discovered knowledge: A methodology for interaction, and usability studies. Technical Report C-1996-3, University Of Helsinki, Department of Computer Science, P.O. 26, 1996 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
webSPADE: A Parallel Sequence Mining Algorithm to Analyze Web Log .. - Demiriz (2002) (1 citation) (Correct)
....spanning a large time window e.g. a quarter. A user friendly front end enables users to choose three di#erent parameters: support levels, time window (start and end date of analysis) and line of business (LOB) to query the sequences. Similar visual pattern analysis techniques are introduced in [1, 2] in the context of the mine and explore paradigm using episode and association mining. Our approach is very simple. webSPADE runs daily with a predetermined support level to find sequences based on di#erent lines of business; Support level is set to 0.1 for General Business and 0.25 for ....
....that webSPADE is run daily and results are stored; there is no on the fly computation when the user selects parameters using the parameter selection screen. In fact, stored results are aggregated and presented to the user. This point is the major di#erence from the previous work introduced in [1, 2]. On the other hand, our methodology requires mining e#orts on a portion of data (for one day) Resulting patterns are then aggregated and presented to the user for visual analysis and pattern search. Moreover, our approach scales up the underlying mining algorithm and visualizes the results ....
M. Klemettinen, H. Mannila, and H. Toivonen. Interactive exploration of discovered knowledge: A methodology for interaction, and usability studies. Technical Report C-1996-3, Department of Computer Science, University of Helsinki, 1996.
Efficient Rule Retrieval and Postponed Restrict.. - Mangold, Güntzer.. (Correct)
....and Outline of this Paper Imielinski et al. describe the idea of working on associations stored in a previous algorithm run [10, 11] In Section 2 we put this approach further by explicitly in troducing a sophisticated rule cache. Other related work covers the idea of rule browsing , e.g. [12, 13]. Our idea is to accept a single and possibly expensive algorithm run to fill the cache. After this initial run all mining queries arising during following iterations through the phases of the KDD process are satisfied directly from the cache without touching the original data. The result is ....
M. Klemettinen, H. Mannila, and H. Toivonen. Interactive exploration of discovered knowledge: A methodology for interaction, and usability studies. Technical Report C-1996-3, University Of Helsinki, Department of Computer Science, P.O. 26, 1996
Efficient Rule Retrieval and Postponed Restrict.. - Hipp, Mangold.. (Correct)
No context found.
M. Klemettinen, H. Mannila, and H. Toivonen. Interactive exploration of discovered knowledge: A methodology for interaction, and usability studies. Technical Report C-1996-3, University Of Helsinki, Department of Computer Science, P.O. 26, 1996
On Analyzing Web Log Data: A Parallel Sequence Mining Algorithm - Demiriz (2003) (Correct)
No context found.
M. Klemettinen, H. Mannila, and H. Toivonen, "Interactive exploration of discovered knowledge: A methodology for interaction, and usability studies," Tech. Rep. C-1996-3, Department of Computer Science, University of Helsinki, 1996.
Exploratory Visualization for Association Rule Rummaging - BLANCHARD, GUILLET, BRIAND (2003) (Correct)
No context found.
Klemettinen, M., Mannila, H., and Toivonen, H. 1996. Interactive exploration of discovered knowledge: a methodology for interaction, and usability studies. Technical report C-1996-3, University of Helsinki.
Efficient Rule Retrieval and Postponed Restrict.. - Hipp, Mangold.. (2002) (Correct)
No context found.
M. Klemettinen, H. Mannila, and H. Toivonen. Interactive exploration of discovered knowledge: A methodology for interaction, and usability studies. Technical Report C-1996-3, University Of Helsinki, Department of Computer Science, P.O. 26, 1996
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