메뉴 건너뛰기




Volumn 8, Issue 3, 2005, Pages 257-275

Visualising hierarchical associations

Author keywords

Association mining; Concept abstraction; Knowledge discovery; Visualisation

Indexed keywords

ASSOCIATION RULES; DATA MINING; SEMANTICS;

EID: 24944496958     PISSN: 02191377     EISSN: 02193116     Source Type: Journal    
DOI: 10.1007/s10115-003-0139-0     Document Type: Review
Times cited : (7)

References (44)
  • 1
    • 0003861416 scopus 로고    scopus 로고
    • Data mining association rules and sequential patterns: Sequential and parallel algorithms
    • Springer, Berlin Heidelberg New York
    • Adamo J (2001) Data mining association rules and sequential patterns: sequential and parallel algorithms. Springer, Berlin Heidelberg New York
    • (2001)
    • Adamo, J.1
  • 5
    • 0004061989 scopus 로고    scopus 로고
    • Graph drawing: Algorithms for the visualization of graphs
    • Prentice Hall, Englewood Cliffs, NJ
    • Battista GD, Eades P, Tamassia R, Tollis IG (1999) Graph drawing: algorithms for the visualization of graphs. Prentice Hall, Englewood Cliffs, NJ
    • (1999)
    • Battista, G.D.1    Eades, P.2    Tamassia, R.3    Tollis, I.G.4
  • 7
    • 1842594378 scopus 로고    scopus 로고
    • Dynamic data mining: Exploring large rule spaces by sampling
    • Stanford University
    • Brin S, Page L (1999) Dynamic data mining: Exploring large rule spaces by sampling, Stanford University
    • (1999)
    • Brin, S.1    Page, L.2
  • 9
    • 24944577676 scopus 로고    scopus 로고
    • Hierarchical association algorithms: A survey
    • Technical Report SIE-03-001, Flinders University, Adelaide, South Australia
    • Ceglar A (2003) Hierarchical association algorithms: A survey. Technical Report SIE-03-001, Flinders University, Adelaide, South Australia
    • (2003)
    • Ceglar, A.1
  • 14
    • 0002401815 scopus 로고
    • Discovery of multiple-level association rules from large databases
    • Zurich, Switzerland
    • Han J, Fu Y (1995) Discovery of multiple-level association rules from large databases. In: 21st international conference on very large databases, Zurich, Switzerland
    • (1995) 21st International Conference on Very Large Databases
    • Han, J.1    Fu, Y.2
  • 15
    • 0039253846 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation
    • Chen W, Naughton J, Bernstein P (eds) ACM, New York, NY
    • Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Chen W, Naughton J, Bernstein P (eds) 2000 ACM SIGMOD international conference on management of data. ACM, New York, NY, pp 1-12
    • (2000) 2000 ACM SIGMOD International Conference on Management of Data , pp. 1-12
    • Han, J.1    Pei, J.2    Yin, Y.3
  • 16
    • 0010415411 scopus 로고    scopus 로고
    • Spatial clustering methods in data mining: A survey
    • Miller H, Han J (eds) Taylor and Francis, London
    • Han J, Kamber M, Tung AKH (2001) Spatial clustering methods in data mining: A survey. In: Miller H, Han J (eds) Geographic data mining and knowledge discovery. Taylor and Francis, London
    • (2001) Geographic Data Mining and Knowledge Discovery
    • Han, J.1    Kamber, M.2    Tung, A.K.H.3
  • 18
    • 0033872934 scopus 로고    scopus 로고
    • Graph visualisation and navigation in information visualization: A survey
    • 10.1109/2945.841119
    • Herman I, Melancon G, Marshall MS (2000a) Graph visualisation and navigation in information visualization: A survey. IEEE Trans Visualiz Comput Graph 6(1):24-43 10.1109/2945.841119
    • (2000) IEEE Trans. Visualiz. Comput. Graph , vol.6 , Issue.1 , pp. 24-43
    • Herman, I.1    Melancon, G.2    Marshall, M.S.3
  • 22
    • 0034593065 scopus 로고    scopus 로고
    • Visualizing association rules with interactive mosaic plots
    • ACM, Boston, MA
    • Hofman H, Siebes AP, Wilhelm AF (2000) Visualizing association rules with interactive mosaic plots. In: KDD 2000, ACM, Boston, MA, pp 227-235
    • (2000) KDD 2000 , pp. 227-235
    • Hofman, H.1    Siebes, A.P.2    Wilhelm, A.F.3
  • 23
    • 0000689545 scopus 로고
    • Tree-maps: A space-filling approach to the visualization of hierarchical information structures
    • Wiley-IEEE Computer Society, Indianapolis, IN
    • Johnson B, Schneiderman B (1991) Tree-maps: A space-filling approach to the visualization of hierarchical information structures. In: IEEE visualization'91. Wiley-IEEE Computer Society, Indianapolis, IN, pp 275-282
    • (1991) IEEE Visualization'91 , pp. 275-282
    • Johnson, B.1    Schneiderman, B.2
  • 24
    • 84921022571 scopus 로고    scopus 로고
    • Data repository
    • KDM (n.d.) KDM Lab, School of Informatics and Engineering, Flinders University
    • KDM (n.d.) Data repository. KDM Lab, School of Informatics and Engineering, Flinders University. http://kdm.first.flinders.edu.au/IDM/
  • 26
    • 84993705519 scopus 로고
    • Fractal approaches for visualizing huge hierarchies
    • Gilbert EP, Olsen KA (eds) IEEE Computer Society
    • Koike H, Yoshihara H (1993) Fractal approaches for visualizing huge hierarchies. In: Gilbert EP, Olsen KA (eds) IEEE symposium on visual languages VL'93. IEEE Computer Society, pp 55-60
    • (1993) IEEE Symposium on Visual Languages VL'93 , pp. 55-60
    • Koike, H.1    Yoshihara, H.2
  • 27
    • 84961678040 scopus 로고    scopus 로고
    • Information visualization using a new focus + context technique in combination with dynamic clustering of information space
    • Kansas City, MO
    • Kreuseler M, Schuman H (1999) Information visualization using a new focus + context technique in combination with dynamic clustering of information space. In: New paradigms in information visualization and manipulation, Kansas City, MO, pp 1-5
    • (1999) New Paradigms in Information Visualization and Manipulation , pp. 1-5
    • Kreuseler, M.1    Schuman, H.2
  • 28
    • 33645611343 scopus 로고    scopus 로고
    • Interactive partitioning
    • Technical report, Mitsubishi Electronic Research Laboratory, Cambridge, MA
    • Lesh N, Marks J, Patrignani M (2000) Interactive partitioning. Technical report, Mitsubishi Electronic Research Laboratory, Cambridge, MA
    • (2000)
    • Lesh, N.1    Marks, J.2    Patrignani, M.3
  • 29
    • 0141853682 scopus 로고    scopus 로고
    • Adaptive-FP: An efficient and effective method for multi-level multi-dimensional frequent pattern mining
    • Thesis, Simon Fraser University, Burnaby, Canada
    • Mao R (2001) Adaptive-FP: An efficient and effective method for multi-level multi-dimensional frequent pattern mining. Thesis, Simon Fraser University, Burnaby, Canada
    • (2001)
    • Mao, R.1
  • 30
    • 39749093168 scopus 로고    scopus 로고
    • The magic number seven, plus or minus two: Some limits on our capacity for processing information
    • 13310704
    • Miller GA (1956) The magic number seven, plus or minus two: Some limits on our capacity for processing information. Psychol Rev 63:81-97 13310704
    • (1996) Psychol. Rev. , vol.63 , pp. 81-97
    • Miller, GA.1
  • 33
    • 84957362320 scopus 로고    scopus 로고
    • Which aesthetic has the greatest effect upon human understanding?
    • Springer, Berlin Heidelberg New York
    • Purchase HC (1998) Which aesthetic has the greatest effect upon human understanding? In: Proceedings of the symposium on graph drawing GD'97. Springer, Berlin Heidelberg New York, pp 248-261
    • (1998) Proceedings of the Symposium on Graph Drawing GD'97 , pp. 248-261
    • Purchase, H.C.1
  • 35
    • 0004129638 scopus 로고    scopus 로고
    • Technical report, Silicon Graphics, Inc., CA
    • Rathjens D (1997), MineSet users guide. Technical report, Silicon Graphics, Inc., CA
    • (1997) MineSet Users Guide
    • Rathjens, D.1
  • 36
    • 84900559084 scopus 로고
    • Cone trees: Animated 3d visualisations of hierarchical information
    • Robertson GG, Mackinley JD, Card SS (1991) Cone trees: Animated 3d visualisations of hierarchical information. In: CHI'91, pp 189-194
    • (1991) CHI'91 , pp. 189-194
    • Robertson, G.G.1    Mackinley, J.D.2    Card, S.S.3
  • 37
    • 84875347155 scopus 로고
    • Onion graphs: Aesthetics and layout
    • Wiley-IEEE Computer Society, Indianapolis, IN
    • Sindre G, Gulla B, Jokstad G (1993) Onion graphs: Aesthetics and layout. In: IEEE/CS symposium on visual languages, Wiley-IEEE Computer Society, Indianapolis, IN, pp 287-291
    • (1993) IEEE/CS Symposium on Visual Languages , pp. 287-291
    • Sindre, G.1    Gulla, B.2    Jokstad, G.3
  • 39
    • 85162588849 scopus 로고    scopus 로고
    • Mining association rules with item constraints
    • Eckerman D, Mannila H, Pregibon D, Uthursamy R (eds) AAAI, Newport Beach, CA
    • Srikant R, Vu Q, Agrawal R (1997) Mining association rules with item constraints. In: Eckerman D, Mannila H, Pregibon D, Uthursamy R (eds) 3rd international conference on knowledge discovery and data mining. AAAI, Newport Beach, CA, pp 67-73
    • (1997) 3rd International Conference on Knowledge Discovery and Data Mining , pp. 67-73
    • Srikant, R.1    Vu, Q.2    Agrawal, R.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.