Letter to the Editor

The paper by Alfons, Croux and Gelper (2013), Sparse least trimmed squares regression for analyzing high-dimensional large data sets, considered a combination of least trimmed squares (LTS) and lasso penalty for robust and sparse high-dimensional regression. In a recent paper [She and Owen (2011)], a method for outlier detection based on a sparsity penalty on the mean shift parameter was proposed (designated by "SO" in the following). This work is mentioned in Alfons et al. as being an "entirely different approach." Certainly the problem studied by Alfons et al. is novel and interesting.Comment: Published in at http://dx.doi.org/10.1214/13-AOAS640 the Annals of Applied Statistics (http://www.imstat.org/aoas/) by the Institute of Mathematical Statistics (http://www.imstat.org

Purchasing Motivations Toward Counterfeit Luxury Goods on E-marketplaces

This research is designed to study consumers’ purchasing attitudes to counterfeit luxury goods on electronic marketplaces (e-marketplaces). And two research hypotheses are proposed in this research. Based on data analysis of 243 samples, this study explores the dimensions of consumer attitudes (morality and law, accessibility, burden-bearing, function effectiveness, economical efficiency) and motivations (conspicuous psychology, rebel psychology, social identity, self-enjoying and cost performance) to luxury counterfeit goods on e-marketplaces. It is found that the major reasons for consumers to choose e-business channels to buy luxury counterfeits are convenience, information acquisition, product and service. In particular, the findings indicate that online consumers’ attitudes toward luxury counterfeit products significantly impact purchasing motivation; online consumers’ attitudes and motivations positively impact purchasing intention

Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding (Technical Report)

The classic problem of exact subgraph matching returns those subgraphs in a large-scale data graph that are isomorphic to a given query graph, which has gained increasing importance in many real-world applications such as social network analysis, knowledge graph discovery in the Semantic Web, bibliographical network mining, and so on. In this paper, we propose a novel and effective graph neural network (GNN)-based path embedding framework (GNN-PE), which allows efficient exact subgraph matching without introducing false dismissals. Unlike traditional GNN-based graph embeddings that only produce approximate subgraph matching results, in this paper, we carefully devise GNN-based embeddings for paths, such that: if two paths (and 1-hop neighbors of vertices on them) have the subgraph relationship, their corresponding GNN-based embedding vectors will strictly follow the dominance relationship. With such a newly designed property of path dominance embeddings, we are able to propose effective pruning strategies based on path label/dominance embeddings and guarantee no false dismissals for subgraph matching. We build multidimensional indexes over path embedding vectors, and develop an efficient subgraph matching algorithm by traversing indexes over graph partitions in parallel and applying our pruning methods. We also propose a cost-model-based query plan that obtains query paths from the query graph with low query cost. Through extensive experiments, we confirm the efficiency and effectiveness of our proposed GNN-PE approach for exact subgraph matching on both real and synthetic graph data