143 research outputs found

    What attracts vehicle consumers’ buying:A Saaty scale-based VIKOR (SSC-VIKOR) approach from after-sales textual perspective?

    Get PDF
    Purpose: The increasingly booming e-commerce development has stimulated vehicle consumers to express individual reviews through online forum. The purpose of this paper is to probe into the vehicle consumer consumption behavior and make recommendations for potential consumers from textual comments viewpoint. Design/methodology/approach: A big data analytic-based approach is designed to discover vehicle consumer consumption behavior from online perspective. To reduce subjectivity of expert-based approaches, a parallel Naïve Bayes approach is designed to analyze the sentiment analysis, and the Saaty scale-based (SSC) scoring rule is employed to obtain specific sentimental value of attribute class, contributing to the multi-grade sentiment classification. To achieve the intelligent recommendation for potential vehicle customers, a novel SSC-VIKOR approach is developed to prioritize vehicle brand candidates from a big data analytical viewpoint. Findings: The big data analytics argue that “cost-effectiveness” characteristic is the most important factor that vehicle consumers care, and the data mining results enable automakers to better understand consumer consumption behavior. Research limitations/implications: The case study illustrates the effectiveness of the integrated method, contributing to much more precise operations management on marketing strategy, quality improvement and intelligent recommendation. Originality/value: Researches of consumer consumption behavior are usually based on survey-based methods, and mostly previous studies about comments analysis focus on binary analysis. The hybrid SSC-VIKOR approach is developed to fill the gap from the big data perspective

    End-of-life vehicle (ELV) recycling management: improving performance using an ISM approach

    Get PDF
    With booming of the automobile industry, China has become the country with increasing car ownership all over the world. However, the end-of-life vehicle (ELV) recycling industry is at infancy, and there is little systematic review on ELV recycling management, as well as low adoption amongst domestic automobile industry. This study presents a literature review and an interpretive structural modeling (ISM) approach is employed to identify the drivers towards Chinese ELV recycling business from government, recycling organizations and consumer’s perspectives, so as to improve the sustainability of automobile supply chain by providing some strategic insights. The results derived from the ISM analysis manifest that regulations on auto-factory, disassembly technique, and value mining of recycling business are the essential ingredients. It is most effective and efficient to promote ELV recycling business by improving these attributes, also the driving and dependence power analysis are deemed to provide guidance on performance improvement of ELV recycling in the Chinese market

    Neural Graph Collaborative Filtering

    Full text link
    Learning vector representations (aka. embeddings) of users and items lies at the core of modern recommender systems. Ranging from early matrix factorization to recently emerged deep learning based methods, existing efforts typically obtain a user's (or an item's) embedding by mapping from pre-existing features that describe the user (or the item), such as ID and attributes. We argue that an inherent drawback of such methods is that, the collaborative signal, which is latent in user-item interactions, is not encoded in the embedding process. As such, the resultant embeddings may not be sufficient to capture the collaborative filtering effect. In this work, we propose to integrate the user-item interactions -- more specifically the bipartite graph structure -- into the embedding process. We develop a new recommendation framework Neural Graph Collaborative Filtering (NGCF), which exploits the user-item graph structure by propagating embeddings on it. This leads to the expressive modeling of high-order connectivity in user-item graph, effectively injecting the collaborative signal into the embedding process in an explicit manner. We conduct extensive experiments on three public benchmarks, demonstrating significant improvements over several state-of-the-art models like HOP-Rec and Collaborative Memory Network. Further analysis verifies the importance of embedding propagation for learning better user and item representations, justifying the rationality and effectiveness of NGCF. Codes are available at https://github.com/xiangwang1223/neural_graph_collaborative_filtering.Comment: SIGIR 2019; the latest version of NGCF paper, which is distinct from the version published in ACM Digital Librar

    Discrete Factorization Machines for Fast Feature-based Recommendation

    Full text link
    User and item features of side information are crucial for accurate recommendation. However, the large number of feature dimensions, e.g., usually larger than 10^7, results in expensive storage and computational cost. This prohibits fast recommendation especially on mobile applications where the computational resource is very limited. In this paper, we develop a generic feature-based recommendation model, called Discrete Factorization Machine (DFM), for fast and accurate recommendation. DFM binarizes the real-valued model parameters (e.g., float32) of every feature embedding into binary codes (e.g., boolean), and thus supports efficient storage and fast user-item score computation. To avoid the severe quantization loss of the binarization, we propose a convergent updating rule that resolves the challenging discrete optimization of DFM. Through extensive experiments on two real-world datasets, we show that 1) DFM consistently outperforms state-of-the-art binarized recommendation models, and 2) DFM shows very competitive performance compared to its real-valued version (FM), demonstrating the minimized quantization loss. This work is accepted by IJCAI 2018.Comment: Appeared in IJCAI 201

    Gestational and lactational α-linolenic acid availability induces epigenetic changes in the brain of mouse offspring

    Get PDF
    It has been acknowledged that dietary n-3 fatty acids improve memory and learning, in part by altering gene expression in the brain. However, the exact mechanisms are far from being clear, especially for α-linolenic acid (ALA). Inadequate perinatal nutrition can induce persistent changes in offspring phenotype, acting through epigenetic process. We investigated the effects of maternal ALA intakes on the epigenetic regulation of memory-associated genes, in the offspring brains, at the end of lactation (postnatal day 19, P19). Postnatal ALA supplementation altered mRNA expression of Mecp2, Ppp1cc, Reelin and Dnmt3a, while ALA deficiency during gestation induced changes in methylation of CpG sites in either promoter or intron1 of these genes. In addition, bivariate analysis indicated some significant associations between CpG site-specific methylation and the expression of Dnmt3a (p < 0.05). In summary, the interplay between ALA availability during gestation and lactation can differentially alter methylation and expression of genes involved in neurogenesis and synaptic plasticity, potentially affecting brain development and memory-related biological processes. However, further studies are needed to confirm the physiological effects of ALA.Master of Scienc

    Riemann-Hilbert problems for axially symmetric monogenic functions in Rn+1\mathbb{R}^{n+1}

    Full text link
    We focus on the Clifford-algebra valued variable coefficients Riemann-Hilbert boundary value problems \big{(}for short RHBVPs\big{)} for axially monogenic functions on Euclidean space Rn+1,nN\mathbb{R}^{n+1},n\in \mathbb{N}. With the help of Vekua system, we first make one-to-one correspondence between the RHBVPs considered in axial domains and the RHBVPs of generalized analytic function on complex plane. Subsequently, we use it to solve the former problems, by obtaining the solutions and solvable conditions of the latter problems, so that we naturally get solutions to the corresponding Schwarz problems. In addition, we also use the above method to extend the case to RHBVPs for axially null-solutions to \big{(}\mathcal{D}-\alpha\big{)}\phi=0,\alpha\in\mathbb{R}.Comment: 14 page

    Enhancing Stock Movement Prediction with Adversarial Training

    Full text link
    This paper contributes a new machine learning solution for stock movement prediction, which aims to predict whether the price of a stock will be up or down in the near future. The key novelty is that we propose to employ adversarial training to improve the generalization of a neural network prediction model. The rationality of adversarial training here is that the input features to stock prediction are typically based on stock price, which is essentially a stochastic variable and continuously changed with time by nature. As such, normal training with static price-based features (e.g. the close price) can easily overfit the data, being insufficient to obtain reliable models. To address this problem, we propose to add perturbations to simulate the stochasticity of price variable, and train the model to work well under small yet intentional perturbations. Extensive experiments on two real-world stock data show that our method outperforms the state-of-the-art solution with 3.11% relative improvements on average w.r.t. accuracy, validating the usefulness of adversarial training for stock prediction task.Comment: IJCAI 201

    Bilinear Graph Neural Network with Neighbor Interactions

    Full text link
    Graph Neural Network (GNN) is a powerful model to learn representations and make predictions on graph data. Existing efforts on GNN have largely defined the graph convolution as a weighted sum of the features of the connected nodes to form the representation of the target node. Nevertheless, the operation of weighted sum assumes the neighbor nodes are independent of each other, and ignores the possible interactions between them. When such interactions exist, such as the co-occurrence of two neighbor nodes is a strong signal of the target node's characteristics, existing GNN models may fail to capture the signal. In this work, we argue the importance of modeling the interactions between neighbor nodes in GNN. We propose a new graph convolution operator, which augments the weighted sum with pairwise interactions of the representations of neighbor nodes. We term this framework as Bilinear Graph Neural Network (BGNN), which improves GNN representation ability with bilinear interactions between neighbor nodes. In particular, we specify two BGNN models named BGCN and BGAT, based on the well-known GCN and GAT, respectively. Empirical results on three public benchmarks of semi-supervised node classification verify the effectiveness of BGNN -- BGCN (BGAT) outperforms GCN (GAT) by 1.6% (1.5%) in classification accuracy.Codes are available at: https://github.com/zhuhm1996/bgnn.Comment: Accepted by IJCAI 2020. SOLE copyright holder is IJCAI (International Joint Conferences on Artificial Intelligence), all rights reserve
    corecore