loading...
Alternative Scalable Algorithms for Lattice-Based Feature Location
Chicago, Illinois September 11-September 14
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICSM.2004.135787020th IEEE International Conference on ...
 This Article 
 
PURCHASE ARTICLE: $0
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Wei Zhao, Peking University
Lu Zhang, Peking University
Dan Hao, Peking University
Hong Mei, Peking University
Jiasu Sun, Peking University
Considering the scalability of using formal concept analysis to locate features in source code, we present a set of alternative straightforward algorithms to achieve the same objectives. A preliminary experiment indicates that the alternative algorithms are more scalable to deal with the large numbers of data to some extent.
Citation:
Wei Zhao, Lu Zhang, Dan Hao, Hong Mei, Jiasu Sun, "Alternative Scalable Algorithms for Lattice-Based Feature Location," icsm, pp.528, 20th IEEE International Conference on Software Maintenance (ICSM'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.