As technology advances we encounter more available data on moving objects, which can be mined to our benefit. In order to efficiently mine this large amount of data we propose an ...
In this paper, we introduce an incremental nested partition algorithm for finding the inner structuralization of dynamic datasets. Here we use three partition criteria that allow...
Data warehouses and recording systems typically have a large continuous stream of incoming data, that must be stored in a manner suitable for future access. Access to stored recor...
H. V. Jagadish, P. P. S. Narayan, S. Seshadri, S. ...
—Analysis and modeling of wireless networks greatly depend on understanding the structure of underlying mobile nodes. In this paper we present two clustering algorithms to determ...
Yung-Chih Chen, Elisha J. Rosensweig, Jim Kurose, ...
Keeping track of changes in user interests from a document stream with a few relevance judgments is not an easy task. To tackle this problem, we propose a novel method that integr...