The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
Nikhil S. Ketkar, Lawrence B. Holder, Diane J. Coo...
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Abstract-- Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of efficient processing of continuous skyline que...
Wenjie Zhang, Xuemin Lin, Ying Zhang, Wei Wang 001...
Clustering aims to find useful hidden structures in data. In this paper we present a new clustering algorithm that builds upon the consistency method (Zhou, et.al., 2003), a semi-...
A new large margin classifier, named MaxiMin Margin Machine (M4 ) is proposed in this paper. This new classifier is constructed based on both a "local" and a "globa...
Kaizhu Huang, Haiqin Yang, Irwin King, Michael R. ...