Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Stream data is common in many applications, e.g., stock quotes, merchandize sales record, system logs, etc.. It is of great importance to analyze these stream data. As one of the ...
We propose a feature selection method that constructs each new feature by analysis of tight error clusters. This is a greedy, time-efficient forward selection algorithm that itera...
We present a slicing-based coherence measure for clusters of DTI integral curves. For a given cluster, we probe samples from the cluster by slicing it with a plane at regularly spa...
It is a key activity in CBD to identify high-quality components which have high cohesion and low coupling. However, component clustering is carried out in manual fashion by develop...