A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Anonymizing Multiple K-anonymous Shortest Paths for Social Graphs
2011
2011 Second International Conference on Innovations in Bio-inspired Computing and Applications
In the past, pre-large fast-updated sequential pattern trees (pre-large FUSP tree) were proposed for efficiently mining large sequences for record insertion and deletion, respectively. In this paper, we thus proposed a maintenance approach for efficiently maintaining pre-large FUSP trees and effectively deriving desired large sequences when data in databases are modified. Experimental results also show that the proposed algorithm has a better performance in execution time.
doi:10.1109/ibica.2011.53
dblp:conf/ibica/WangTHTT11
fatcat:zeggaucvlbbxne7vvryuwsbzra