A data warehouse collects and maintains integrated information from heterogeneous data sources for OLAP and decision support. An important task in data warehouse design is the selection of views to materialize, in order to minimize the response time and maintenance cost of generalized project-select-join (GPSJ) queries. We discuss how to construct GPSJ view graphs. GPSJ view graphs are directed...

Graph-based and transition-based approaches to dependency parsing adopt very different views of the problem, each view having its own strengths and limitations. We study both approaches under the framework of beamsearch. By developing a graph-based and a transition-based dependency parser, we show that a beam-search decoder is a competitive choice for both methods. More importantly, we propose ...

Graph-based and transition-based approaches to dependency parsing adopt very different views of the problem, each view having its own strengths and limitations. We study both approaches under the framework of beamsearch. By developing a graph-based and a transition-based dependency parser, we show that a beam-search decoder is a competitive choice for both methods. More importantly, we propose ...

Multi-view spectral clustering, which aims at yielding an agreement or consensus data objects grouping across multi-views with their graph laplacian matrices, is a fundamental clustering problem. Among the existing methods, Low-Rank Representation (LRR) based method is quite superior in terms of its effectiveness, intuitiveness and robustness to noise corruptions. However, it aggressively tries...

Twitter, as a popular social network, has been targeted by different bot attacks. Detecting bots is challenging task, due to their evolving capacity avoid detection. Extensive research efforts have proposed techniques and approaches solving this problem. Due the scarcity of recently updated labeled data, performance detection systems degrades when exposed new dataset. Therefore, semi-supervised...

Graph-based multi-view clustering methods aim to explore the partition patterns by utilizing a similarity graph. However, many existing construct consensus graph based on original space, which may result in lack of information underlying low-dimensional space. Additionally, these often fail effectively handle noise present To address issues, novel graph-based method combines spectral embedding,...

Materialization and hierarchical routing algorithms are becoming important tools in querying databases for the shortest paths in time-critical applications like Intelligent Transportation Systems (ITS), due to the growing size of their spatial graph databases 16]. A hierarchical routing algorithm decomposes the original graph into a set of fragment graphs and a boundary graph which summarizes t...