Given a spatial crime data warehouse, that is updated infrequently and a set of operations O as well as constraints of storage and update overheads, the index type selection probl...
Pradeep Mohan, Ronald E. Wilson, Shashi Shekhar, B...
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...
This paper presents a time series whole clustering system that incrementally constructs a tree-like hierarchy of clusters, using a top-down strategy. The Online Divisive-Agglomera...
Active learning techniques have gained popularity in reducing human effort to annotate data instances for inducing a classifier. When faced with large quantities of unlabeled dat...