Query: An Intelligent Anti-phishing Strategy Model for Phishing Website Detection

Relevant passages:
CANTINA+: A Feature-Rich Machine Learning Framework for Detecting Phishing Web Sites <=SEP=> Phishing is a plague in cyberspace. Typically, phish detection methods either use human-verified URL blacklists or exploit Web page features via machine learning techniques. However, the former is frail in terms of new phish, and the latter suffers from the scarcity of effective features and the high false positive rate (FP). To alleviate those problems, we propose a layered anti-phishing solution that aims at (1) exploiting the expressiveness of a rich set of features with machine learning to achieve a high true positive rate (TP) on novel phish, and (2) limiting the FP to a low level via filtering algorithms.
 Specifically, we proposed CANTINA+, the most comprehensive feature-based approach in the literature including eight novel features, which exploits the HTML Document Object Model (DOM), search engines and third party services with machine learning techniques to detect phish. Moreover, we designed two filters to help reduce FP and achieve runtime speedup. The first is a near-duplicate phish detector that uses hashing to catch highly similar phish. The second is a login form filter, which directly classifies Web pages with no identified login form as legitimate.
 We extensively evaluated CANTINA+ with two methods on a diverse spectrum of corpora with 8118 phish and 4883 legitimate Web pages. In the randomized evaluation, CANTINA+ achieved over 92% TP on unique testing phish and over 99% TP on near-duplicate testing phish, and about 0.4% FP with 10% training phish. In the time-based evaluation, CANTINA+ also achieved over 92% TP on unique testing phish, over 99% TP on near-duplicate testing phish, and about 1.4% FP under 20% training phish with a two-week sliding window. Capable of achieving 0.4% FP and over 92% TP, our CANTINA+ has been demonstrated to be a competitive anti-phishing solution.

Survey of clustering algorithms <=SEP=> Data analysis plays an indispensable role for understanding various phenomena. Cluster analysis, primitive exploration with little or no prior knowledge, consists of research developed across a wide variety of communities. The diversity, on one hand, equips us with many tools. On the other hand, the profusion of options causes confusion. We survey clustering algorithms for data sets appearing in statistics, computer science, and machine learning, and illustrate their applications in some benchmark data sets, the traveling salesman problem, and bioinformatics, a new field attracting intensive efforts. Several tightly related topics, proximity measure, and cluster validation, are also discussed.

Term-Weighting Approaches in Automatic Text Retrieval <=SEP=> The experimental evidence accumulated over the past 20 years indicates that text indexing systems based on the assignment of appropriately weighted single terms produce retrieval results that are superior to those obtainable with other more elaborate text representations. These results depend crucially on the choice of effective termweighting systems. This article summarizes the insights gained in automatic term weighting, and provides baseline single-term-indexing models with which other more elaborate content analysis procedures can be compared. 1. AUTOMATIC TEXT ANALYSIS In the late 195Os, Luhn [l] first suggested that automatic text retrieval systems could be designed based on a comparison of content identifiers attached both to the stored texts and to the users’ information queries. Typically, certain words extracted from the texts of documents and queries would be used for content identification; alternatively, the content representations could be chosen manually by trained indexers familiar with the subject areas under consideration and with the contents of the document collections. In either case, the documents would be represented by term vectors of the form D= (ti,tj,...ytp) (1) where each tk identifies a content term assigned to some sample document D. Analogously, the information requests, or queries, would be represented either in vector form, or in the form of Boolean statements. Thus, a typical query Q might be formulated as Q = (qa,qbr.. . ,4r) (2)

A Statistical Approach to Mechanized Encoding and Searching of Literary Information <=SEP=> Written communication of ideas is carried out on the basis of statistical probability in that a writer chooses that level of subject specificity and that combination of words which he feels will convey the most meaning. Since this process varies among individuals and since similar ideas are therefore relayed at different levels of specificity and by means of different words, the problem of literature searching by machines still presents major difficulties. A statistical approach to this problem will be outlined and the various steps of a system based on this approach will be described. Steps include the statistical analysis of a collection of documents in a field of interest, the establishment of a set of "notions" and the vocabulary by which they are expressed, the compilation of a thesaurus-type dictionary and index, the automatic encoding of documents by machine with the aid of such a dictionary, the encoding of topological notations (such as branched structures), the recording of the coded information, the establishment of a searching pattern for finding pertinent information, and the programming of appropriate machines to carry out a search.

Client-Side Defense Against Web-Based Identity Theft <=SEP=> Web spoofing is a significant problem involving fraudulent email and web sites that trick unsuspecting users into revealing private information. We discuss some aspects of common attacks and propose a framework for client-side defense: a browser plug-in that examines web pages and warns the user when requests for data may be part of a spoof attack. While the plugin, SpoofGuard, has been tested using actual sites obtained through government agencies concerned about the problem, we expect that web spoofing and other forms of identity theft will be continuing problems in

Computational intelligence in sports: Challenges and opportunities within a new research domain <=SEP=> Computational intelligence is a branch of artificial intelligence that comprises algorithms inspired by nature. The common characteristics of all these algorithms is their collective intelligence and adaptability to a changing environment. Due to their efficiency and simplicity, these algorithms have been employed for problem solving across social and natural sciences. The aim of this paper is to demonstrate that nature-inspired algorithms are also useful within the domain of sport, in particular for obtaining safe and effective training plans targeting various aspects of performance. We outline the benefits and opportunities of applying computational intelligence in sports, and we also comment on the pitfalls and challenges for the future development of this emerging research domain. © 2015 Elsevier Inc. All rights reserved.

Vehicle-to-Vehicle Communication: Fair Transmit Power Control for Safety-Critical Information <=SEP=> Direct radio-based vehicle-to-vehicle communication can help prevent accidents by providing accurate and up-to-date local status and hazard information to the driver. In this paper, we assume that two types of messages are used for traffic safety-related communication: 1) Periodic messages (ldquobeaconsrdquo) that are sent by all vehicles to inform their neighbors about their current status (i.e., position) and 2) event-driven messages that are sent whenever a hazard has been detected. In IEEE 802.11 distributed-coordination-function-based vehicular networks, interferences and packet collisions can lead to the failure of the reception of safety-critical information, in particular when the beaconing load leads to an almost-saturated channel, as it could easily happen in many critical vehicular traffic conditions. In this paper, we demonstrate the importance of transmit power control to avoid saturated channel conditions and ensure the best use of the channel for safety-related purposes. We propose a distributed transmit power control method based on a strict fairness criterion, i.e., distributed fair power adjustment for vehicular environments (D-FPAV), to control the load of periodic messages on the channel. The benefits are twofold: 1) The bandwidth is made available for higher priority data like dissemination of warnings, and 2) beacons from different vehicles are treated with ldquoequal rights,rdquo and therefore, the best possible reception under the available bandwidth constraints is ensured. We formally prove the fairness of the proposed approach. Then, we make use of the ns-2 simulator that was significantly enhanced by realistic highway mobility patterns, improved radio propagation, receiver models, and the IEEE 802.11p specifications to show the beneficial impact of D-FPAV for safety-related communications. We finally put forward a method, i.e., emergency message dissemination for vehicular environments (EMDV), for fast and effective multihop information dissemination of event-driven messages and show that EMDV benefits of the beaconing load control provided by D-FPAV with respect to both probability of reception and latency.

Determining Gains Acquired from Word Embedding Quantitatively Using Discrete Distribution Clustering <=SEP=> Word embeddings have become widelyused in document analysis. While a large number of models for mapping words to vector spaces have been developed, it remains undetermined how much net gain can be achieved over traditional approaches based on bag-of-words. In this paper, we propose a new document clustering approach by combining any word embedding with a state-of-the-art algorithm for clustering empirical distributions. By using the Wasserstein distance between distributions, the word-to-word semantic relationship is taken into account in a principled way. The new clustering method is easy to use and consistently outperforms other methods on a variety of data sets. More importantly, the method provides an effective framework for determining when and how much word embeddings contribute to document analysis. Experimental results with multiple embedding models are reported.

Cyberbullying perpetration and victimization among adolescents in Hong Kong <=SEP=> a r t i c l e i n f o Cyberbullying is a growing concern worldwide. Using a sample of 1917 secondary adolescents from seven schools, five psychometric measures (self-efficacy, empathy level, feelings regarding a harmonious school, sense of belonging to the school, and psychosocial wellbeing) and five scales regarding bullying experiences (cyber-and traditional bullying perpetration and victimization; reactions to cyberbullying victimization) were administered to explore the prevalence of cyberbullying in Hong Kong. Findings indicated that male adolescents were more likely than female adolescents to cyberbully others and to be cyber-victimized. Cyberbullying perpe-tration and victimization were found to be negatively associated with the adolescents' psychosocial health and sense of belonging to school. Cyber-and traditional bullying were positively correlated. Multivariate analyses indicated that being male, having a low sense of belonging to school, involvement in traditional bullying perpetra-tion, and experiencing cyber-victimization were associated with an increased propensity to cyberbully others. Technology is advancing rapidly, and peer harassment and aggression are no longer limited to traditional bullying through physical contact. Over the past decade, information and communication technology (ICT) has become increasingly important in the lives of adolescents. In a report by Lenhart, Madden, and Hitlin (2005), it is estimated that close to 90% of American adolescents aged 12 to 17 years surf the Inter-net, with 51% of them using it on a daily basis. Nearly half of the adolescents surveyed have personal mobile phones, and 33% have used a mobile phone to send a text message (Lenhart et al., 2005). Such heavy use of the Internet is not novel among adolescents in Hong Kong. Many empirical studies have been conducted on Hong Kong adolescents on their excessive and/or addictive use of the Internet. Findings of recent studies indicate that a substantially high prevalence rate of internet addiction is reported among Hong Kong adolescents (range In reality, the heavy usage of ICT such as instant mes-saging, e-mail, text messaging, blogs, and social networking sites not only allows adolescents to connect with friends and family, but at the same time also creates the potential to meet and interact with others in harmful ways (Ybarra, Diener-West, & Leaf, 2007). Cyberbullying or online bullying is one such growing concern. Traditional bullying is a widespread problem in both school and community settings, and has long been researched by scholars in general, involves an individual being exposed to negative actions by one or more individuals regularly …

Dynamic Modeling and Performance Analysis of a Grid-Connected Current-Source Inverter-Based Photovoltaic System <=SEP=> Voltage-source inverter (VSI) topology is widely used for grid interfacing of distributed generation (DG) systems. However, when employed as the power conditioning unit in photovoltaic (PV) systems, VSI normally requires another power electronic converter stage to step up the voltage, thus adding to the cost and complexity of the system. To make the proliferation of grid-connected PV systems a successful business option, the cost, performance, and life expectancy of the power electronic interface need to be improved. The current-source inverter (CSI) offers advantages over VSI in terms of inherent boosting and short-circuit protection capabilities, direct output current controllability, and ac-side simpler filter structure. Research on CSI-based DG is still in its infancy. This paper focuses on modeling, control, and steady-state and transient performances of a PV system based on CSI. It also performs a comparative performance evaluation of VSI-based and CSI-based PV systems under transient and fault conditions. Analytical expectations are verified using simulations in the Power System Computer Aided Design/Electromagnetic Transient Including DC (PSCAD/EMTDC) environment, based on a detailed system model.

3D deeply supervised network for automated segmentation of volumetric medical images <=SEP=> While deep convolutional neural networks (CNNs) have achieved remarkable success in 2D medical image segmentation, it is still a difficult task for CNNs to segment important organs or structures from 3D medical images owing to several mutually affected challenges, including the complicated anatomical environments in volumetric images, optimization difficulties of 3D networks and inadequacy of training samples. In this paper, we present a novel and efficient 3D fully convolutional network equipped with a 3D deep supervision mechanism to comprehensively address these challenges; we call it 3D DSN. Our proposed 3D DSN is capable of conducting volume-to-volume learning and inference, which can eliminate redundant computations and alleviate the risk of over-fitting on limited training data. More importantly, the 3D deep supervision mechanism can effectively cope with the optimization problem of gradients vanishing or exploding when training a 3D deep model, accelerating the convergence speed and simultaneously improving the discrimination capability. Such a mechanism is developed by deriving an objective function that directly guides the training of both lower and upper layers in the network, so that the adverse effects of unstable gradient changes can be counteracted during the training procedure. We also employ a fully connected conditional random field model as a post-processing step to refine the segmentation results. We have extensively validated the proposed 3D DSN on two typical yet challenging volumetric medical image segmentation tasks: (i) liver segmentation from 3D CT scans and (ii) whole heart and great vessels segmentation from 3D MR images, by participating two grand challenges held in conjunction with MICCAI. We have achieved competitive segmentation results to state-of-the-art approaches in both challenges with a much faster speed, corroborating the effectiveness of our proposed 3D DSN.

Targeted Employee Retention : Performance-Based and Job-Related Differences in Reported Reasons for Staying <=SEP=> A content model of 12 retention factors is developed in the context of previous theory and research. Coding of open-ended responses from 24,829 employees in the leisure and hospitality industry lends support to the identified framework and reveals that job satisfaction, extrinsic rewards, constituent attachments, organizational commitment, and organizational prestige were the most frequently mentioned reasons for staying. Advancement opportunities and organizational prestige were more common reasons for staying among high performers and non-hourly workers, and extrinsic rewards was more common among low performers and hourly employees, providing support for ease/desirability of movement and psychological contract rationales. The findings highlight the importance of differentiating human resource management practices when the goal is to retain those employees valued most by the organization.

An Alpha-wave-based binaural beat sound control system using fuzzy logic and autoregressive forecasting model <=SEP=> We are developing a new real-time control system for customizing auditory stimulus (the binaural beat sound) by judging user alpha waves to entrain a userpsilas feeling in the most relaxed way. Since brainwave activity provides the necessary predictive information for arousal states, we use an autoregressive forecasting model to estimate the frequency response series of the alpha frequency bands and the inverted-U concept to determine the userpsilas arousal state. A fuzzy logic controller is also employed to regulate the binaural beat control signal on a forecasting error signal. Our system allows comfortable user self-relaxation. The results of experiments confirm the constructed systempsilas effectiveness and necessity.

A Comparative Study of Stereovision Algorithms <=SEP=> Stereo vision has been and continues to be one of the most researched domains of computer vision, having many applications, among them, allowing the depth extraction of a scene. This paper provides a comparative study of stereo vision and matching algorithms, used to solve the correspondence problem. The study of matching algorithms was followed by experiments on the Middlebury benchmarks. The tests focused on a comparison of 6 stereovision methods. In order to assess the performance, RMS and some statistics related were computed. In order to emphasize the advantages of each stereo algorithm considered, two-frame methods have been employed, both local and global. The experiments conducted have shown that the best results are obtained by Graph Cuts. Unfortunately, this has a higher computational cost. If high quality is not an issue in applications, local methods provide reasonable results within a much lower time-frame and offer the possibility of parallel

Learning to rank academic experts in the DBLP dataset <=SEP=> Expert finding is an information retrieval task that is concerned with the search for the most knowledgeable people with respect to a specific topic, and the search is based on documents that describe people’s activities. The task involves taking a user query as input and returning a list of people who are sorted by their level of expertise with respect to the user query. Despite recent interest in the area, the current state-of-the-art techniques lack in principled approaches for optimally combining different sources of evidence. This article proposes two frameworks for combining multiple estimators of expertise. These estimators are derived from textual contents, from graph-structure of the citation patterns for the community of experts, and from profile information about the experts. More specifically, this article explores the use of supervised learning to rank methods, as well as rank aggregation approaches, for combing all of the estimators of expertise. Several supervised learning algorithms, which are representative of the pointwise, pairwise and listwise approaches, were tested, and various state-of-the-art data fusion techniques were also explored for the rank aggregation framework. Experiments that were performed on a dataset of academic publications from the Computer Science domain attest the adequacy of the proposed approaches.

A novel end-to-end classifier using domain transferred deep convolutional neural networks for biomedical images <=SEP=> BACKGROUND AND OBJECTIVES
Highly accurate classification of biomedical images is an essential task in the clinical diagnosis of numerous medical diseases identified from those images. Traditional image classification methods combined with hand-crafted image feature descriptors and various classifiers are not able to effectively improve the accuracy rate and meet the high requirements of classification of biomedical images. The same also holds true for artificial neural network models directly trained with limited biomedical images used as training data or directly used as a black box to extract the deep features based on another distant dataset. In this study, we propose a highly reliable and accurate end-to-end classifier for all kinds of biomedical images via deep learning and transfer learning.


METHODS
We first apply domain transferred deep convolutional neural network for building a deep model; and then develop an overall deep learning architecture based on the raw pixels of original biomedical images using supervised training. In our model, we do not need the manual design of the feature space, seek an effective feature vector classifier or segment specific detection object and image patches, which are the main technological difficulties in the adoption of traditional image classification methods. Moreover, we do not need to be concerned with whether there are large training sets of annotated biomedical images, affordable parallel computing resources featuring GPUs or long times to wait for training a perfect deep model, which are the main problems to train deep neural networks for biomedical image classification as observed in recent works.


RESULTS
With the utilization of a simple data augmentation method and fast convergence speed, our algorithm can achieve the best accuracy rate and outstanding classification ability for biomedical images. We have evaluated our classifier on several well-known public biomedical datasets and compared it with several state-of-the-art approaches.


CONCLUSIONS
We propose a robust automated end-to-end classifier for biomedical images based on a domain transferred deep convolutional neural network model that shows a highly reliable and accurate performance which has been confirmed on several public biomedical image datasets.

Single-Fed Low-Profile High-Gain Circularly Polarized Slotted Cavity Antenna Using a High-Order Mode <=SEP=> In this letter, a single-fed low-profile high-gain circularly polarized slotted cavity antenna using a high-order cavity mode, i.e., TE440 mode, is proposed. The proposed antenna has a simple structure that consists of a radiating linearly polarized slotted cavity antenna and a linear-to-circular polarization converter. An antenna prototype operating at WLAN 5.8-GHz band fabricated with low-cost standard printed circuit board (PCB) process is exemplified to validate the proposed concept. Measured results compared to their simulated counterparts are presented, and a good agreement between simulation and measurement is obtained.

VAMS 2017: Workshop on Value-Aware and Multistakeholder Recommendation <=SEP=> In this paper, we summarize VAMS 2017 - a workshop on value-aware and multistakeholder recommendation co-located with RecSys 2017. The workshop encouraged forward-thinking papers in this new area of recommender systems research and obtained a diverse set of responses ranging from application results to research overviews.

Articulated pose estimation with flexible mixtures-of-parts <=SEP=> We describe a method for human pose estimation in static images based on a novel representation of part models. Notably, we do not use articulated limb parts, but rather capture orientation with a mixture of templates for each part. We describe a general, flexible mixture model for capturing contextual co-occurrence relations between parts, augmenting standard spring models that encode spatial relations. We show that such relations can capture notions of local rigidity. When co-occurrence and spatial relations are tree-structured, our model can be efficiently optimized with dynamic programming. We present experimental results on standard benchmarks for pose estimation that indicate our approach is the state-of-the-art system for pose estimation, outperforming past work by 50% while being orders of magnitude faster.

Learning from Explicit and Implicit Supervision Jointly For Algebra Word Problems <=SEP=> Automatically solving algebra word problems has raised considerable interest recently. Existing state-of-the-art approaches mainly rely on learning from human annotated equations. In this paper, we demonstrate that it is possible to efficiently mine algebra problems and their numerical solutions with little to no manual effort. To leverage the mined dataset, we propose a novel structured-output learning algorithm that aims to learn from both explicit (e.g., equations) and implicit (e.g., solutions) supervision signals jointly. Enabled by this new algorithm, our model gains 4.6% absolute improvement in accuracy on the ALG514 benchmark compared to the one without using implicit supervision. The final model also outperforms the current state-of-the-art approach by 3%.

Fault investigations on die-cast copper rotors <=SEP=> It has been long known to the market that, the use of copper in the rotor in place of aluminium, taking advantage of copper's high conductivity, can be an economic solution for various applications, including electric vehicle, in the development of energy efficient motors. In comparison to aluminium, copper die-casting is extremely difficult to perform due to its high density, viscosity and melting point. Owing to these reasons, the copper die-cast rotors will evince several manufacturing problems. The objective of this paper is to identify the various defects in the manufacturing of copper die-cast rotor, and identify the lamination-coating-condition that sustains copper die-cast pressure and temperature. This paper evaluates the effectiveness of lamination coating on limiting the eddy current loss, and the recoating process to improve, in case the eddy current losses are in excess due to copper die-casting.

The recognition of rice images by UAV based on capsule network <=SEP=> It is important to recognize the rice image captured by unmanned aerial vehicle (UAV) for monitoring the growth of rice and preventing the diseases and pests. Aiming at the image recognition, we use rice images captured by UAV as our data source, the structure of capsule network (CapsNet) is built to recognize rice images in this paper. The images are preprocessed through histogram equalization method into grayscale images and through superpixel algorithm into the superpixel segmentation results. The both results are output into the CapsNet. The function of CapsNet is to perform the reverse analysis of rice images. The CapsNet consists of five layers: an input layer, a convolution layer, a primary capsules layer, a digital capsules layer and an output layer. The CapsNet trains classification and predicts the output vector based on routing-by-agreement protocol. Therefore, the features of rice image by UAV can be precisely and efficiently extracted. The method is more convenient than the traditional artificial recognition. It provides the scientific support and reference for decision-making process of precision agriculture.

A functional taxonomy of wireless sensor network devices <=SEP=> With the availability of cheap computing technology and the standardization of different wireless communication paradigms, wireless sensor networks (WSNs) are becoming a reality. This is visible in the increasing amount of research being done in the WSN area, and the growing number of companies offering commercial WSN solutions. In this regard, we realize that there is a need for an unambiguous classification and definition of WSN devices. Such a classification scheme would benefit the WSN research and industrial community. We consider the spectrum of wireless devices ranging from passive RF devices to gateway devices for the classification. The classification scheme is based on functionality of the devices. This scheme is analogous to an object-oriented classification, where an object is classified on the basis of its functionality and is described by its attributes. Attributes of the wireless devices are grouped into five broad categories: communication, sensing, power, memory, and "other features". Each of these are further classified to provide sufficient details that are required for a typical WSN application

Permittivity and Loss Tangent Characterization for Garment Antennas Based on a New Matrix-Pencil Two-Line Method <=SEP=> The emergence of wearable antennas to be integrated into garments has revealed the need for a careful electromagnetic characterization of textile materials. Therefore, we propose in this paper a new matrix-pencil two-line method that removes perturbations in the calculated effective permittivity and loss tangent which are caused by imperfect deembedding and inhomogeneities of the textile microstrip line structure. The approach has been rigorously validated for high-frequency laminates by comparing measured and simulated data for the resonance frequency of antennas designed using the calculated parameters. The method has been successfully applied to characterize the permittivity and loss tangent of a variety of textile materials and up to a frequency of 10 GHz. Furthermore it is shown that the use of electrotextiles in antenna design influences the effective substrate permittivity.

Adapting Naive Bayes to Domain Adaptation for Sentiment Analysis <=SEP=> In the community of sentiment analysis, supervised learning techniques have been shown to perform very well. When transferred to another domain, however, a supervised sentiment classifier often performs extremely bad. This is so-called domain-transfer problem. In this work, we attempt to attack this problem by making the maximum use of both the old-domain data and the unlabeled new-domain data. To leverage knowledge from the old-domain data, we proposed an effective measure, i.e., Frequently Co-occurring Entropy (FCE), to pick out generalizable features that occur frequently in both domains and have similar occurring probability. To gain knowledge from the newdomain data, we proposed Adapted Naïve Bayes (ANB), a weighted transfer version of Naive Bayes Classifier. The experimental results indicate that proposed approach could improve the performance of base classifier dramatically, and even provide much better performance than the transfer-learning baseline, i.e. the Naïve Bayes Transfer Classifier (NTBC).

Mining geographic-temporal-semantic patterns in trajectories for location prediction <=SEP=> In recent years, research on location predictions by mining trajectories of users has attracted a lot of attention. Existing studies on this topic mostly treat such predictions as just a type of location recommendation, that is, they predict the next location of a user using location recommenders. However, an user usually visits somewhere for reasons other than interestingness. In this article, we propose a novel mining-based location prediction approach called Geographic-Temporal-Semantic-based Location Prediction (GTS-LP), which takes into account a user's geographic-triggered intentions, temporal-triggered intentions, and semantic-triggered intentions, to estimate the probability of the user in visiting a location. The core idea underlying our proposal is the discovery of trajectory patterns of users, namely GTS patterns, to capture frequent movements triggered by the three kinds of intentions. To achieve this goal, we define a new trajectory pattern to capture the key properties of the behaviors that are motivated by the three kinds of intentions from trajectories of users. In our GTS-LP approach, we propose a series of novel matching strategies to calculate the similarity between the current movement of a user and discovered GTS patterns based on various moving intentions. On the basis of similitude, we make an online prediction as to the location the user intends to visit. To the best of our knowledge, this is the first work on location prediction based on trajectory pattern mining that explores the geographic, temporal, and semantic properties simultaneously. By means of a comprehensive evaluation using various real trajectory datasets, we show that our proposed GTS-LP approach delivers excellent performance and significantly outperforms existing state-of-the-art location prediction methods.

Feature Selection and Kernel Learning for Local Learning-Based Clustering <=SEP=> The performance of the most clustering algorithms highly relies on the representation of data in the input space or the Hilbert space of kernel methods. This paper is to obtain an appropriate data representation through feature selection or kernel learning within the framework of the Local Learning-Based Clustering (LLC) (Wu and Schölkopf 2006) method, which can outperform the global learning-based ones when dealing with the high-dimensional data lying on manifold. Specifically, we associate a weight to each feature or kernel and incorporate it into the built-in regularization of the LLC algorithm to take into account the relevance of each feature or kernel for the clustering. Accordingly, the weights are estimated iteratively in the clustering process. We show that the resulting weighted regularization with an additional constraint on the weights is equivalent to a known sparse-promoting penalty. Hence, the weights of those irrelevant features or kernels can be shrunk toward zero. Extensive experiments show the efficacy of the proposed methods on the benchmark data sets.

Effects of Transformational Leadership Training on Attitudinal and Financial Outcomes : A Field Experiment <=SEP=> A pretest-posttest control-group design (N = 20) was used to assess the effects of transformational leadership training, with 9 and 11 managers assigned randomly to training and control groups, respectively. Training consisted of a 1-day group session and 4 individual booster sessions thereafter on a monthly basis. Multivariate analyses of covariance, with pretest scores as the covariate, showed that the training resulted in significant effects on subordinates' perceptions of leaders' transformational leadership, subordinates' own organizational commitment, and 2 aspects of branch-level financial performance.

Using Phase Instead of Optical Flow for Action Recognition <=SEP=> Currently, the most common motion representation for action recognition is optical flow. Optical flow is based on particle tracking which adheres to a Lagrangian perspective on dynamics. In contrast to the Lagrangian perspective, the Eulerian model of dynamics does not track, but describes local changes. For video, an Eulerian phase-based motion representation, using complex steerable filters, has been successfully employed recently for motion magnification and video frame interpolation. Inspired by these previous works, here, we proposes learning Eulerian motion representations in a deep architecture for action recognition. We learn filters in the complex domain in an end-to-end manner. We design these complex filters to resemble complex Gabor filters, typically employed for phase-information extraction. We propose a phaseinformation extraction module, based on these complex filters, that can be used in any network architecture for extracting Eulerian representations. We experimentally analyze the added value of Eulerian motion representations, as extracted by our proposed phase extraction module, and compare with existing motion representations based on optical flow, on the UCF101 dataset.

A generalized taxonomy of explanations styles for traditional and social recommender systems <=SEP=> Recommender systems usually provide explanations of their recommendations to better help users to choose products, activities or even friends. Up until now, the type of an explanation style was considered in accordance to the recommender system that employed it. This relation was one-to-one, meaning that for each different recommender systems category, there was a different explanation style category. However, this kind of one-to-one correspondence can be considered as over-simplistic and non generalizable. In contrast, we consider three fundamental resources that can be used in an explanation: users, items and features and any combination of them. In this survey, we define (i) the Human style of explanation, which provides explanations based on similar users, (ii) the Item style of explanation, which is based on choices made by a user on similar items and (iii) the Feature style of explanation, which explains the recommendation based on item features rated by the user beforehand. By using any combination of the aforementioned styles we can also define the Hybrid style of explanation. We demonstrate how these styles are put into practice, by presenting recommender systems that employ them. Moreover, since there is inadequate research in the impact of social web in contemporary recommender systems and their explanation styles, we study new emerged social recommender systems i.e. Facebook Connect explanations (HuffPo, Netflix, etc.) and geo-social explanations that combine geographical with social data (Gowalla, Facebook Places, etc.). Finally, we summarize the results of three different user studies, to support that Hybrid is the most effective explanation style, since it incorporates all other styles.