Institution
Alibaba Group
Company•Hangzhou, China•
About: Alibaba Group is a company organization based out in Hangzhou, China. It is known for research contribution in the topics: Computer science & Terminal (electronics). The organization has 6810 authors who have published 7389 publications receiving 55653 citations. The organization is also known as: Alibaba Group Holding Limited & Alibaba Group (Cayman Islands).
Topics: Computer science, Terminal (electronics), Graph (abstract data type), Node (networking), Deep learning
Papers published on a yearly basis
Papers
More filters
•
03 Jun 2010TL;DR: In this article, an upper layer application program is used to generate a payment request based on a command and send the payment request to local host address of the mobile device via a predetermined port.
Abstract: Processing payment through a mobile device includes: receiving a command; using an upper layer application program on the mobile device to generate a payment request based on the command and send the payment request to localhost address of the mobile device via a predetermined port; using a lower layer payment program on the mobile device to monitor the payment request sent from the localhost address of the mobile device via the predetermined port; in response to the payment request, using the lower layer payment program to provide an input interface for payment information in and receive the input payment information; using the lower layer payment program to connect with a payment server and pass the payment information over a network to the payment server; and using the lower layer payment program to transfer a payment processing result received from the payment server, to the upper layer application program.
32 citations
•
TL;DR: This paper proposes to construct a large-scale E-commerce Cognitive Concept Net named "AliCoCo", which is practiced in Alibaba, the largest Chinese e-commerce platform in the world, and presents details on how AliCoCo is constructed semi-automatically and its successful, ongoing and potential applications in e- commerce.
Abstract: One of the ultimate goals of e-commerce platforms is to satisfy various shopping needs for their customers. Much efforts are devoted to creating taxonomies or ontologies in e-commerce towards this goal. However, user needs in e-commerce are still not well defined, and none of the existing ontologies has the enough depth and breadth for universal user needs understanding. The semantic gap in-between prevents shopping experience from being more intelligent. In this paper, we propose to construct a large-scale e-commerce cognitive concept net named "AliCoCo", which is practiced in Alibaba, the largest Chinese e-commerce platform in the world. We formally define user needs in e-commerce, then conceptualize them as nodes in the net. We present details on how AliCoCo is constructed semi-automatically and its successful, ongoing and potential applications in e-commerce.
32 citations
•
TL;DR: A newimal-dual mirror descent algorithm is proposed and it is shown that one can attain regret and constraint violation under a much weaker Lagrange multiplier assumption, allowing general equality constraints and significantly relaxing the previous Slater conditions.
Abstract: We consider online convex optimization with stochastic constraints where the objective functions are arbitrarily time-varying and the constraint functions are independent and identically distributed (i.i.d.) over time. Both the objective and constraint functions are revealed after the decision is made at each time slot. The best known expected regret for solving such a problem is $\mathcal{O}(\sqrt{T})$, with a coefficient that is polynomial in the dimension of the decision variable and relies on the Slater condition (i.e. the existence of interior point assumption), which is restrictive and in particular precludes treating equality constraints. In this paper, we show that such Slater condition is in fact not needed. We propose a new primal-dual mirror descent algorithm and show that one can attain $\mathcal{O}(\sqrt{T})$ regret and constraint violation under a much weaker Lagrange multiplier assumption, allowing general equality constraints and significantly relaxing the previous Slater conditions. Along the way, for the case where decisions are contained in a probability simplex, we reduce the coefficient to have only a logarithmic dependence on the decision variable dimension. Such a dependence has long been known in the literature on mirror descent but seems new in this new constrained online learning scenario.
32 citations
••
10 Aug 2015TL;DR: This paper proposes a new Maximum Entropy Semi Markov Model to segment and label consumer life stage based on the observed purchasing data over time and develops an efficient approximate solution using large scale logistic regression and a Viterbi-like algorithm in the mom-baby product category.
Abstract: Although marketing researchers and sociologists have recognized the large impact of life stage on consumer's purchasing behaviors, existing recommender systems have not taken this impact into consideration. In this paper, we found obvious correlation between life stage and purchasing behavior in many E-commerce categories. For example, a mum may look for different suitable products when her baby is at different ages. Motivated by this, we introduce the conception of life stage into recommender systems and propose to predict a user's current life-stage and recommend products correspondingly. We propose a new Maximum Entropy Semi Markov Model to segment and label consumer life stage based on the observed purchasing data over time. In the mom-baby product category where the life stage transition is deterministic, we develop an efficient approximate solution using large scale logistic regression and a Viterbi-like algorithm. We also propose a Gaussian mixture model to efficiently handle multi-kids life stage prediction problem. We integrate the life stage information predicted into the recommender system behind the largest online shopping website taobao.com. Both offline and online experiments demonstrate the effectiveness of the proposed life-stage based recommendation approach.
32 citations
••
TL;DR: A data-driven model based on deep dynamic features extracting and transferring methods to build a virtual sensor for f-CaO content prediction is proposed, and compared with traditional statistical modeling methods, the prediction accuracy of f- CaO content is significantly improved.
Abstract: The content of free calcium oxide (f-CaO) in clinker significantly determines the quality of the final cement production. However, in practice, the value of f-CaO content in clinker is off-line sampled manually with a significant time interval and then analyzed in a laboratory with a large time delay, which could meet the needs for monitoring and control of cement quality. To tackle this problem, this article proposes a data-driven model based on deep dynamic features extracting and transferring methods to build a virtual sensor for f-CaO content prediction. First, in this model, large-scale unlabeled data collected from the process distributed control system (DCS) take a vital effect in extracting nonlinear dynamic features along with the limited labeled data samples. Then, the extracted features are transferred to a powerful regression model, the eXtreme Gradient Boosting (XGBoost), for output f-CaO prediction. Besides, an incremental model updating strategy is proposed for the augment of online data samples, which facilitates the virtual sensor to adapt the process time-variant characteristics. Finally, the proposed virtual sensor is verified by a data set acquired from a real cement production process. Comparing with traditional statistical modeling methods, the prediction accuracy of f-CaO content is significantly improved.
32 citations
Authors
Showing all 6829 results
Name | H-index | Papers | Citations |
---|---|---|---|
Philip S. Yu | 148 | 1914 | 107374 |
Lei Zhang | 130 | 2312 | 86950 |
Jian Xu | 94 | 1366 | 52057 |
Wei Chu | 80 | 670 | 28771 |
Le Song | 76 | 345 | 21382 |
Yuan Xie | 76 | 739 | 24155 |
Narendra Ahuja | 76 | 474 | 29517 |
Rong Jin | 75 | 449 | 19456 |
Beng Chin Ooi | 73 | 408 | 19174 |
Wotao Yin | 72 | 303 | 27233 |
Deng Cai | 70 | 326 | 24524 |
Xiaofei He | 70 | 260 | 28215 |
Irwin King | 67 | 476 | 19056 |
Gang Wang | 65 | 373 | 21579 |
Xiaodan Liang | 61 | 318 | 14121 |