Brain-computer interface (BCI) is a new way for man-machine interaction with wide applications, in which steady-state visual evoked potentials (SSVEP) is a promising option. However, many characteristics of SSVEP show...
详细信息
Most existing rat able aspect generating methods for aspect mining focus on identifying and rating aspects of reviews with overall ratings, while huge amount of unrated reviews are beyond their ability. This drawback ...
详细信息
ISBN:
(纸本)9781479943012
Most existing rat able aspect generating methods for aspect mining focus on identifying and rating aspects of reviews with overall ratings, while huge amount of unrated reviews are beyond their ability. This drawback motivates the research problem in this paper: predicting aspect ratings and overall ratings for unrated reviews. To solve this problem, we novelly propose a topic model based on Latent Dirichlet Allocation with indirect supervision. Compared with the previous bag-of-words representation of review documents, we utilize the quad-tuples of (head, modifier, rating, entity) to explicitly model the associations between modifiers and ratings. Specifically, our solution for aspect mining in unrated reviews is decomposed into three steps. Firstly, rat able aspects are generated over sentiments from training reviews with overall ratings. Afterwards, inference of aspect identification and rating for unrated reviews are provided. Finally, overall ratings are predicted for unrated reviews. Under this framework, aspect and sentiment associations are captured in the form of joint probabilities through a generative process. The effectiveness of our approach is testified on a real-world dataset crawled from Trip Advisor http://***/, and extensive experiments show that our method significantly outperforms state-of-the-art methods.
The training algorithm of classical twin support vector regression (TSVR) can be attributed to the solution of a pair of quadratic programming problems (QPPs) with inequality constraints in the dual ***,this solution ...
详细信息
The training algorithm of classical twin support vector regression (TSVR) can be attributed to the solution of a pair of quadratic programming problems (QPPs) with inequality constraints in the dual ***,this solution is affected by time and memory constraints when dealing with large *** this paper,we present a least squares version for TSVR in the primal space,termed primal least squares TSVR (PLSTSVR).By introducing the least squares method,the inequality constraints of TSVR are transformed into equality ***,we attempt to directly solve the two QPPs with equality constraints in the primal space instead of the dual space;thus,we need only to solve two systems of linear equations instead of two *** results on artificial and benchmark datasets show that PLSTSVR has comparable accuracy to TSVR but with considerably less computational *** further investigate its validity in predicting the opening price of stock.
The power consumption of enormous network devices in data centers has emerged as a big concern to data center operators. Despite many traffic-engineering-based solutions, very little attention has been paid on perform...
详细信息
The power consumption of enormous network devices in data centers has emerged as a big concern to data center operators. Despite many traffic-engineering-based solutions, very little attention has been paid on performance-guaranteed energy saving schemes. In this paper, we propose a novel energy-saving model for data center networks by scheduling and routing "deadline-constrained flows" where the transmission of every flow has to be accomplished before a rigorous deadline, being the most critical requirement in production data center networks. Based on speed scaling and power-down energy saving strategies for network devices, we aim to explore the most energy efficient way of scheduling and routing flows on the network, as well as determining the transmission speed for every flow. We consider two general versions of the problem. For the version of only flow scheduling where routes of flows are pre-given, we show that it can be solved polynomially and we develop an optimal combinatorial algorithm for it. For the version of joint flow scheduling and routing, we prove that it is strongly NP-hard and cannot have a Fully Polynomial-Time Approximation Scheme (FPTAS) unless P=NP. Based on a relaxation and randomized rounding technique, we provide an efficient approximation algorithm which can guarantee a provable performance ratio with respect to a polynomial of the total number of flows.
In this paper,the development and construction of hub airport with hub-and-spoke system as the starting point to analyze the operating conditions of flight bank in domestic and international typical hub airports,and i...
详细信息
In this paper,the development and construction of hub airport with hub-and-spoke system as the starting point to analyze the operating conditions of flight bank in domestic and international typical hub airports,and indicate the importance of improving efficiency of flight schedules by the use of flight ***,this paper expatiates on the conception and operating features of flight bank,puts forward the construct process around several important aspects including quantity definition,time distribution and configuration,and then makes time to optimize the time distribution and design the structure *** has great guiding significance for reasonable designation and operation of flight bank to advance the operation efficiency of large hub airports with hub-and-spoke system.
With the rapid increase of websites and internet users,the traditional search engine will face great challenge in the real-time search,response speed and mass storage *** cloud computing with two major advantages in m...
详细信息
With the rapid increase of websites and internet users,the traditional search engine will face great challenge in the real-time search,response speed and mass storage *** cloud computing with two major advantages in massive data processing and mass data storage,so the search engine deployed in the cloud can solve these *** analyzing the open-source cloud computing system Hadoop,cloud platform search engine model is constructed and search engine algorithm is optimized to improve the overall performance of search engines.
The problem of efficiently finding top-k frequent items has attracted much attention in recent years. Storage constraints in the processing node and intrinsic evolving feature of the data streams are two main challeng...
详细信息
ISBN:
(纸本)9781479967162
The problem of efficiently finding top-k frequent items has attracted much attention in recent years. Storage constraints in the processing node and intrinsic evolving feature of the data streams are two main challenges. In this paper, we propose a method to tackle these two challenges based on space-saving and gossip-based algorithms respectively. Our method is implemented on SAMOA, a scalable advanced massive online analysis machine learning framework. The experimental results show its effectiveness and scalability.
The precise prediction of bus routes or the arrival time of buses for a traveler can enhance the quality of bus service. However, many social factors influence people's preferences for taking buses. These social f...
详细信息
暂无评论