\Identity disclosure" problem on publishing social network data has gained intensive focus from academia. Existing k-anonymization algorithms on social network may result in n...
Yazhe WANG, Long XIE, Baihua ZHENG, and Ken C. K. ...
We present the S-Space Package, an open source framework for developing and evaluating word space algorithms. The package implements well-known word space algorithms, such as LSA,...
The incorporation of temporal semantic into the traditional data mining techniques has caused the creation of a new area called Temporal Data Mining. This incorporation is especial...
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...