Paper Info
Title
Alternative scalable algorithms for lattice-based feature location
Abstract
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.
Year
DOI
Venue
2004
10.1109/ICSM.2004.1357870
ICSM
Keywords
Field
DocType
preliminary experiment,alternative algorithm,alternative straightforward algorithm,scalable algorithms,lattice-based feature location,formal concept analysis,large number,data visualisation,source code,alternative scalable algorithms,formal specification,binary relation,concept analysis
Data mining,Data visualization,Lattice (order),Source code,Computer science,Lattice Miner,Formal specification,Formal methods,Formal concept analysis,Scalability
Conference
ISSN
ISBN
Citations 
1063-6773
0-7695-2213-0
2
PageRank 
References 
Authors
0.41
2
5
Name
Order
Citations
PageRank
Wei Zhao11738.65
Lingming Zhang22726154.39
Dan Hao386341.59
Hong Mei43535219.36
Jiasu Sun569432.02