메뉴 건너뛰기




Volumn , Issue , 2005, Pages 259-268

Clustering software artifacts based on frequent common changes

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING; SOFTWARE SYSTEMS; SUBSYSTEMS;

EID: 27744483105     PISSN: 10928138     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WPC.2005.12     Document Type: Conference Paper
Times cited : (95)

References (39)
  • 1
    • 0029354779 scopus 로고
    • Recent directions in netlist partitioning: A survey
    • C. J. Alpert and A. B. Kahng. Recent directions in netlist partitioning: A survey. Integration, the VLSI Journal, 19(1-2):1-81, 1995.
    • (1995) Integration, the VLSI Journal , vol.19 , Issue.1-2 , pp. 1-81
    • Alpert, C.J.1    Kahng, A.B.2
  • 2
    • 84944610992 scopus 로고    scopus 로고
    • Software clustering based on information loss minimization
    • IEEE
    • P. Andritsos and V. Tzerpos. Software clustering based on information loss minimization. In Proc. WCRE, pages 334-344. IEEE, 2003.
    • (2003) Proc. WCRE , pp. 334-344
    • Andritsos, P.1    Tzerpos, V.2
  • 3
    • 84950990898 scopus 로고    scopus 로고
    • A comparison of graphs of concept for reverse engineering
    • IEEE
    • N. Anquetil. A comparison of graphs of concept for reverse engineering. In Proc. IWPC, pages 231-240. IEEE, 2000.
    • (2000) Proc. IWPC , pp. 231-240
    • Anquetil, N.1
  • 4
    • 0031597149 scopus 로고    scopus 로고
    • Extracting concepts from file names: A new file clustering criterion
    • IEEE
    • N. Anquetil and T. Lethbridge. Extracting concepts from file names: A new file clustering criterion. In Proc. ICSE, pages 84-93. IEEE, 1998.
    • (1998) Proc. ICSE , pp. 84-93
    • Anquetil, N.1    Lethbridge, T.2
  • 6
    • 33846349887 scopus 로고
    • A hierarchical O(N log N) force-calculation algorithm
    • J. Barnes and P. Hut. A hierarchical O(N log N) force-calculation algorithm. Nature, 324:446-449, 1986.
    • (1986) Nature , vol.324 , pp. 446-449
    • Barnes, J.1    Hut, P.2
  • 8
    • 3042815535 scopus 로고    scopus 로고
    • Architecture-aware adaptive clustering of OO systems
    • IEEE
    • M. Bauer and M. Trifu. Architecture-aware adaptive clustering of OO systems. In Proc. CSMR, pages 3-14. IEEE, 2004.
    • (2004) Proc. CSMR , pp. 3-14
    • Bauer, M.1    Trifu, M.2
  • 9
    • 27744501509 scopus 로고    scopus 로고
    • Mining co-change clusters from version repositories
    • Ecole Polytechnique Fédérale de Lausanne (EPFL)
    • D. Beyer and A. Noack. Mining co-change clusters from version repositories. Technical Report IC/2005/003, Ecole Polytechnique Fédérale de Lausanne (EPFL), 2005.
    • (2005) Technical Report , vol.IC-2005-003
    • Beyer, D.1    Noack, A.2
  • 10
    • 84944531804 scopus 로고    scopus 로고
    • Reconstructing ownership architectures to help understand software systems
    • IEEE
    • I. T. Bowman and R. C. Holt. Reconstructing ownership architectures to help understand software systems. In Proc. IWPC, pages 28-37. IEEE, 1999.
    • (1999) Proc. IWPC , pp. 28-37
    • Bowman, I.T.1    Holt, R.C.2
  • 13
    • 0029252659 scopus 로고
    • Software salvaging and the call dominance tree
    • A. Cimitile and G. Visaggio. Software salvaging and the call dominance tree. Journal of Systems and Software, 28(2):117-127, 1995.
    • (1995) Journal of Systems and Software , vol.28 , Issue.2 , pp. 117-127
    • Cimitile, A.1    Visaggio, G.2
  • 14
    • 0030264246 scopus 로고    scopus 로고
    • Drawing graphs nicely using simulated annealing
    • R. Davidson and D. Harel. Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics, 15(4):301-331, 1996.
    • (1996) ACM Transactions on Graphics , vol.15 , Issue.4 , pp. 301-331
    • Davidson, R.1    Harel, D.2
  • 15
    • 0001070640 scopus 로고
    • A heuristic for graph drawing
    • P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149-160, 1984.
    • (1984) Congressus Numerantium , vol.42 , pp. 149-160
    • Eades, P.1
  • 16
    • 84997930789 scopus 로고
    • Navigating large networks with hierarchies
    • S. G. Eick and G. J. Wills. Navigating large networks with hierarchies. In Proc. Visualization, pages 204-210, 1993.
    • (1993) Proc. Visualization , pp. 204-210
    • Eick, S.G.1    Wills, G.J.2
  • 18
    • 84943162054 scopus 로고    scopus 로고
    • CVS release history data for detecting logical couplings
    • IEEE
    • H. Gall, M. Jazayeri, and J. Krajewski. CVS release history data for detecting logical couplings. In Proc. IWPSE, pages 84-94. IEEE, 2003.
    • (2003) Proc. IWPSE , pp. 84-94
    • Gall, H.1    Jazayeri, M.2    Krajewski, J.3
  • 19
    • 0033208054 scopus 로고    scopus 로고
    • A metric-based approach to detect abstract data types and state encapsulations
    • J.-F. Girard, R. Koschke, and G. Schied. A metric-based approach to detect abstract data types and state encapsulations. Automated Software Engineering, 6(4):357-386, 1999.
    • (1999) Automated Software Engineering , vol.6 , Issue.4 , pp. 357-386
    • Girard, J.-F.1    Koschke, R.2    Schied, G.3
  • 21
    • 0024640140 scopus 로고
    • An algorithm for drawing general undirected graphs
    • T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31(1):7-15, 1989.
    • (1989) Information Processing Letters , vol.31 , Issue.1 , pp. 7-15
    • Kamada, T.1    Kawai, S.2
  • 22
    • 84951099346 scopus 로고    scopus 로고
    • A framework for experimental evaluation of clustering techniques
    • IEEE
    • R. Koschke and T. Eisenbarth. A framework for experimental evaluation of clustering techniques. In Proc. IWPC, pages 201-210. IEEE, 2000.
    • (2000) Proc. IWPC , pp. 201-210
    • Koschke, R.1    Eisenbarth, T.2
  • 24
    • 0026205471 scopus 로고
    • An information retrieval approach for automatically constructing software libraries
    • Y. S. Maarek, D. M. Berry, and G. E. Kaiser. An information retrieval approach for automatically constructing software libraries. IEEE Transactions on Software Engineering, 17(8):800-813, 1991.
    • (1991) IEEE Transactions on Software Engineering , vol.17 , Issue.8 , pp. 800-813
    • Maarek, Y.S.1    Berry, D.M.2    Kaiser, G.E.3
  • 25
    • 24644511741 scopus 로고    scopus 로고
    • Automatic software clustering via latent semantic analysis
    • IEEE
    • J. I. Maletic and N. Valluri. Automatic software clustering via latent semantic analysis. In Proc. ASE, pages 251-254. IEEE, 1999.
    • (1999) Proc. ASE , pp. 251-254
    • Maletic, J.I.1    Valluri, N.2
  • 26
    • 0033325448 scopus 로고    scopus 로고
    • Bunch: A clustering tool for the recovery and maintenance of software system structures
    • IEEE
    • S. Mancoridis, B. S. Mitchell, Y. Chen, and E. R. Gansner. Bunch: A clustering tool for the recovery and maintenance of software system structures. In Proc. ICSM, pages 50-59. IEEE, 1999.
    • (1999) Proc. ICSM , pp. 50-59
    • Mancoridis, S.1    Mitchell, B.S.2    Chen, Y.3    Gansner, E.R.4
  • 27
    • 77956617019 scopus 로고    scopus 로고
    • Comparing the decompositions produced by software clustering algorithms using similarity measurements
    • IEEE
    • B. S. Mitchell and S. Mancoridis. Comparing the decompositions produced by software clustering algorithms using similarity measurements. In Proc. ICSM, pages 744-753. IEEE, 2001.
    • (2001) Proc. ICSM , pp. 744-753
    • Mitchell, B.S.1    Mancoridis, S.2
  • 28
    • 0025511777 scopus 로고
    • Composing subsystem structures using (k,2)-partite graphs
    • IEEE
    • H. A. Müller and J. S. Uhl. Composing subsystem structures using (k,2)-partite graphs. In Proc. ICSM, pages 12-19. IEEE, 1990.
    • (1990) Proc. ICSM , pp. 12-19
    • Müller, H.A.1    Uhl, J.S.2
  • 30
    • 35048875189 scopus 로고    scopus 로고
    • An energy model for visual graph clustering
    • LNCS 2912. Springer
    • A. Noack. An energy model for visual graph clustering. In Proc. GD'03, LNCS 2912, pages 425-436. Springer, 2004.
    • (2004) Proc. GD'03 , pp. 425-436
    • Noack, A.1
  • 31
    • 27744472022 scopus 로고    scopus 로고
    • Visual clustering of graphs with nonuniform degrees
    • Brandenburg University of Technology at Cottbus (BTU)
    • A. Noack. Visual clustering of graphs with nonuniform degrees. Technical Report 02/04, Brandenburg University of Technology at Cottbus (BTU), 2004.
    • (2004) Technical Report , vol.2 , Issue.4
    • Noack, A.1
  • 32
    • 84958535557 scopus 로고    scopus 로고
    • FADE: Graph drawing, clustering, and visual abstraction
    • LNCS 1984. Springer
    • A. J. Quigley and P. Eades. FADE: Graph drawing, clustering, and visual abstraction. In Proc. GD'00, LNCS 1984, pages 197-210. Springer, 2001.
    • (2001) Proc. GD'00 , pp. 197-210
    • Quigley, A.J.1    Eades, P.2
  • 33
    • 0026237262 scopus 로고
    • An intelligent tool for re-engineering software modularity
    • IEEE
    • R. W. Schwanke. An intelligent tool for re-engineering software modularity. In Proc. ICSE, pages 83-92. IEEE, 1991.
    • (1991) Proc. ICSE , pp. 83-92
    • Schwanke, R.W.1
  • 35
    • 0034497484 scopus 로고    scopus 로고
    • ACDC: An algorithm for comprehension-driven clustering
    • IEEE
    • V. Tzerpos and R. C. Holt. ACDC: An algorithm for comprehension-driven clustering. In Proc. WCRE, pages 258-267. IEEE, 2000.
    • (2000) Proc. WCRE , pp. 258-267
    • Tzerpos, V.1    Holt, R.C.2
  • 37
    • 10044254675 scopus 로고    scopus 로고
    • An effectiveness measure for software clustering algorithms
    • IEEE
    • Z. Wen and V. Tzerpos. An effectiveness measure for software clustering algorithms. In Proc. IWPC, pages 194-203. IEEE, 2004.
    • (2004) Proc. IWPC , pp. 194-203
    • Wen, Z.1    Tzerpos, V.2
  • 38
    • 84943196231 scopus 로고    scopus 로고
    • How history justifies system architecture (or not)
    • IEEE
    • T. Zimmermann, S. Diehl, and A. Zeller. How history justifies system architecture (or not). In Proc. IWPSE, pages 73-83. IEEE, 2003.
    • (2003) Proc. IWPSE , pp. 73-83
    • Zimmermann, T.1    Diehl, S.2    Zeller, A.3
  • 39
    • 4544295325 scopus 로고    scopus 로고
    • Mining version histories to guide software changes
    • IEEE
    • T. Zimmermann, P. Weigerber, S. Diehl, and A. Zeller. Mining version histories to guide software changes. In Proc. ICSE, pages 563-572. IEEE, 2004.
    • (2004) Proc. ICSE , pp. 563-572
    • Zimmermann, T.1    Weigerber, P.2    Diehl, S.3    Zeller, A.4


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