Query: A Comprehensive Survey of Neighborhood-Based Recommendation Methods

Relevant passages:
Novelty and redundancy detection in adaptive filtering <=SEP=> This paper addresses the problem of extending an adaptive information filtering system to make decisions about the novelty and redundancy of relevant documents. It argues that relevance and redundance should each be modelled explicitly and separately. A set of five redundancy measures are proposed and evaluated in experiments with and without redundancy thresholds. The experimental results demonstrate that the cosine similarity metric and a redundancy measure based on a mixture of language models are both effective for identifying redundant documents.

Effective missing data prediction for collaborative filtering <=SEP=> Memory-based collaborative filtering algorithms have been widely adopted in many popular recommender systems, although these approaches all suffer from data sparsity and poor prediction quality problems. Usually, the user-item matrix is quite sparse, which directly leads to inaccurate recommendations. This paper focuses the memory-based collaborative filtering problems on two crucial factors: (1) similarity computation between users or items and (2) missing data prediction algorithms. First, we use the enhanced Pearson Correlation Coefficient (PCC) algorithm by adding one parameter which overcomes the potential decrease of accuracy when computing the similarity of users or items. Second, we propose an effective missing data prediction algorithm, in which information of both users and items is taken into account. In this algorithm, we set the similarity threshold for users and items respectively, and the prediction algorithm will determine whether predicting the missing data or not. We also address how to predict the missing data by employing a combination of user and item information. Finally, empirical studies on dataset MovieLens have shown that our newly proposed method outperforms other state-of-the-art collaborative filtering algorithms and it is more robust against data sparsity.

Item-based top-N recommendation algorithms <=SEP=> The explosive growth of the world-wide-web and the emergence of e-commerce has led to the development of recommender systems---a personalized information filtering technology used to identify a set of items that will be of interest to a certain user. User-based collaborative filtering is the most successful technology for building recommender systems to date and is extensively used in many commercial recommender systems. Unfortunately, the computational complexity of these methods grows linearly with the number of customers, which in typical commercial applications can be several millions. To address these scalability concerns model-based recommendation techniques have been developed. These techniques analyze the user--item matrix to discover relations between the different items and use these relations to compute the list of recommendations.In this article, we present one such class of model-based recommendation algorithms that first determines the similarities between the various items and then uses them to identify the set of items to be recommended. The key steps in this class of algorithms are (i) the method used to compute the similarity between the items, and (ii) the method used to combine these similarities in order to compute the similarity between a basket of items and a candidate recommender item. Our experimental evaluation on eight real datasets shows that these item-based algorithms are up to two orders of magnitude faster than the traditional user-neighborhood based recommender systems and provide recommendations with comparable or better quality.

ItemRank: A Random-Walk Based Scoring Algorithm for Recommender Engines <=SEP=> Recommender systems are an emerging technology that helps consumers to find interesting products. A recommender system makes personalized product suggestions by extracting knowledge from the previous users interactions. In this paper, we present ”ItemRank”, a random–walk based scoring algorithm, which can be used to rank products according to expected user preferences, in order to recommend top–rank items to potentially interested users. We tested our algorithm on a standard database, the MovieLens data set, which contains data collected from a popular recommender system on movies, that has been widely exploited as a benchmark for evaluating recently proposed approaches to recommender system (e.g. [Fouss et al., 2005; Sarwar et al., 2002]). We compared ItemRank with other state-of-the-art ranking techniques (in particular the algorithms described in [Fouss et al., 2005]). Our experiments show that ItemRank performs better than the other algorithms we compared to and, at the same time, it is less complex than other proposed algorithms with respect to memory usage and computational cost too.

Using Linear Algebra for Intelligent Information Retrieval <=SEP=> Currently most approaches to retrieving textual materials from scienti c databases depend on a lexical match between words in users requests and those in or assigned to documents in a database Because of the tremendous diversity in the words people use to describe the same document lexical methods are necessarily incomplete and imprecise Using the singular value decomposition SVD one can take advantage of the implicit higher order structure in the association of terms with documents by determining the SVD of large sparse term by document matrices Terms and documents represented by of the largest singular vectors are then matched against user queries We call this retrieval method Latent Semantic Indexing LSI because the subspace represents important associative relationships between terms and documents that are not evident in individual documents LSI is a completely automatic yet intelligent indexing method widely applicable and a promising way to improve users access to many kinds of textual materials or to documents and services for which textual descriptions are available A survey of the computational requirements for managing LSI encoded databases as well as current and future applications of LSI is presented

On the Duration, Addressability, and Capacity of Memory-Augmented Recurrent Neural Networks <=SEP=> Memory-augmented recurrent neural networks (M-RNNs) have demonstrated empirically that they are very attractive for many applications, but a good theoretical understanding of their behaviors is unclear yet. In this paper, three analytical indicators named duration, addressability, and capacity of general forms of the additional memory in M-RNNs are formalized. The analysis results of the interactions among these indicators reveal that it is hard for an M-RNN to simultaneously provide good performance on more than two out of three of indicators. Meanwhile, the duration, addressability, and capacity are applied to analyze and compare two M-RNNs: long short term memory and neural turing machine for different cases. The comparison results show that none of the models has better performance on one indicator than the other model all the time. Moreover, it is found that separating memory system into sub-memories can bring the increasing duration and addressability and the decreasing capacity for the whole memory system.

Top-Down Induction of First-Order Logical Decision Trees <=SEP=> 

Effective Implementation of DGEMM on Modern Multicore CPU <=SEP=> In this paper we will present a detailed study on tuning double-precision matrix-matrix multiplication (DGEMM) on the Intel Xeon E5-2680 CPU. We selected an optimal algorithm from the instruction set perspective as well software tools optimized for Intel Advance Vector Extensions (AVX). Our optimizations included the use of vector memory operations, and AVX instructions. Our proposed algorithm achieves a performance improvement of 33% compared to the latest results achieved using the Intel Math Kernel Library DGEMM subroutine.

New trends in gender and mathematics performance: a meta-analysis. <=SEP=> In this article, we use meta-analysis to analyze gender differences in recent studies of mathematics performance. First, we meta-analyzed data from 242 studies published between 1990 and 2007, representing the testing of 1,286,350 people. Overall, d = 0.05, indicating no gender difference, and variance ratio = 1.08, indicating nearly equal male and female variances. Second, we analyzed data from large data sets based on probability sampling of U.S. adolescents over the past 20 years: the National Longitudinal Surveys of Youth, the National Education Longitudinal Study of 1988, the Longitudinal Study of American Youth, and the National Assessment of Educational Progress. Effect sizes for the gender difference ranged between -0.15 and +0.22. Variance ratios ranged from 0.88 to 1.34. Taken together, these findings support the view that males and females perform similarly in mathematics.

Factorial LDA: Sparse Multi-Dimensional Text Models <=SEP=> Latent variable models can be enriched with a multi-dimensional structure to consider the many latent factors in a text corpus, such as topic, author perspective and sentiment. We introduce factorial LDA, a multi-dimensional model in which a document is influenced by K different factors, and each word token depends on a K-dimensional vector of latent variables. Our model incorporates structured word priors and learns a sparse product of factors. Experiments on research abstracts show that our model can learn latent factors such as research topic, scientific discipline, and focus (methods vs. applications). Our modeling improvements reduce test perplexity and improve human interpretability of the discovered factors.

Fuzzy logic control of energy storage system in microgrid operation <=SEP=> Recent development in Renewable Energy Sources (RES) have led to a higher penetration in existing power systems. As the majority of RES are intermittent by nature, it presents major challenges to the grid operators. An Energy Storage System (ESS) can be connected to mitigate this intermittent sources. When multiple renewable energy sources, flexible loads and ESS are connected to the grid, complexity of the system is significantly increased. Such problems have multiple constraints and objective hence it is challenging to design an effective rule-based control strategy. A control strategy based on fuzzy logic which is similar to human reasoning tolerates uncertainties and imprecision. The proposed fuzzy inference system (FIS) aims to reduce the grid fluctuation and increase the energy storage life-cycle by deciding when and how much to charge/discharge the ESS. A real data was used to test and validate the proposed FIS. In this paper, MATLAB/Simulink is used to create and implement the microgrid test bench and FIS. The proposed methodology is tested against a rule-based control strategy. Simulation studies were carried out on the developed model and results have shown that the proposed FIS can effectively reduce the fluctuation and prolong the life cycle of the ESS.

Multiple Text Document Summarization System using hybrid Summarization technique <=SEP=> Text Summarization plays an important role in the area of text mining and natural language processing. As the information resources are increasing tremendously, readers are overloaded with loads of information. Finding out the relevant data and manually summarizing it in short time is much more difficult, challenging and tedious task for a human being. Text Summarization aims to compress the source text into a shorter and concise form with preserving its information content and overall meaning. Summarization can be classified into two main categories i.e. extractive summarization and abstractive summarization. This paper presents a novel approach to generate abstractive summary from extractive summary using WordNet ontology. An experimental result shows the generated summary in well-compressed, grammatically correct and human readable format.

The facial width-to-height ratio determines interpersonal distance preferences in the observer. <=SEP=> Facial width-to-height ratio (fWHR) is correlated with a number of aspects of aggressive behavior in men. Observers appear to be able to assess aggressiveness from male fWHR, but implications for interpersonal distance preferences have not yet been determined. This study utilized a novel computerized stop-distance task to examine interpersonal space preferences of female participants who envisioned being approached by a man; men's faces photographed posed in neutral facial expressions were shown in increasing size to mimic approach. We explored the effect of the men's fWHR, their behavioral aggression (measured previously in a computer game), and women's ratings of the men's aggressiveness, attractiveness, and masculinity on the preferred interpersonal distance of 52 German women. Hierarchical linear modelling confirmed the relationship between the fWHR and trait judgements (ratings of aggressiveness, attractiveness, and masculinity). There were effects of fWHR and actual aggression on the preferred interpersonal distance, even when controlling statistically for men's and the participants' age. Ratings of attractiveness, however, was the most influential variable predicting preferred interpersonal distance. Our results extend earlier findings on fWHR as a cue of aggressiveness in men by demonstrating implications for social interaction. In conclusion, women are able to accurately detect aggressiveness in emotionally neutral facial expressions, and adapt their social distance preferences accordingly.

Denoising autoencoder with modulated lateral connections learns invariant representations of natural images <=SEP=> Suitable lateral connections between encoder and decoder are shown to allow higher layers of a denoising autoencoder (dAE) to focus on invariant representations. In regular autoencoders, detailed information needs to be carried through the highest layers but lateral connections from encoder to decoder relieve this pressure. It is shown that abstract invariant features can be translated to detailed reconstructions when invariant features are allowed to modulate the strength of the lateral connection. Three dAE structures with modulated and additive lateral connections, and without lateral connections were compared in experiments using real-world images. The experiments verify that adding modulated lateral connections to the model 1) improves the accuracy of the probability model for inputs, as measured by denoising performance; 2) results in representations whose degree of invariance grows faster towards the higher layers; and 3) supports the formation of diverse invariant poolings.

Naive (Bayes) at Forty: The Independence Assumption in Information Retrieval <=SEP=> The naive Bayes classiier, currently experiencing a renaissance in machine learning, has long been a core technique in information retrieval. We review some of the variations of naive Bayes models used for text retrieval and classiication, focusing on the distributional assumptions made about word occurrences in documents.

Short text classification based on Wikipedia and Word2vec <=SEP=> Different from long texts, the features of Chinese short texts is much sparse, which is the primary cause of the low accuracy in the classification of short texts by using traditional classification methods. In this paper, a novel method was proposed to tackle the problem by expanding the features of short text based on Wikipedia and Word2vec. Firstly, build the semantic relevant concept sets of Wikipedia. We get the articles that have high relevancy with Wikipedia concepts and use the word2vec tools to measure the semantic relatedness between target concepts and related concepts. And then we use the relevant concept sets to extend the short texts. Compared to traditional similarity measurement between concepts using statistical method, this method can get more accurate semantic relatedness. The experimental results show that by expanding the features of short texts, the classification accuracy can be improved. Specifically, our method appeared to be more effective.

The effect of shame and shame memories on paranoid ideation and social anxiety. <=SEP=> BACKGROUND
Social wariness and anxiety can take different forms. Paranoid anxiety focuses on the malevolence of others, whereas social anxiety focuses on the inadequacies in the self in competing for social position and social acceptance. This study investigates whether shame and shame memories are differently associated with paranoid and social anxieties.


METHOD
Shame, traumatic impact of shame memory, centrality of shame memory, paranoia and social anxiety were assessed using self-report questionnaires in 328 participants recruited from the general population.


RESULTS
Results from path analyses show that external shame is specifically associated with paranoid anxiety. In contrast, internal shame is specifically associated with social anxiety. In addition, shame memories, which function like traumatic memories, or that are a central reference point to the individual's self-identity and life story, are significantly associated with paranoid anxiety, even when current external and internal shame are considered at the same time. Thus, traumatic impact of shame memory and centrality of shame memory predict paranoia (but not social anxiety) even when considering for current feelings of shame.


CONCLUSION
Our study supports the evolutionary model suggesting there are two different types of 'conspecific' anxiety, with different evolutionary histories, functions and psychological processes. Paranoia, but less so social anxiety, is associated with traumatic impact and the centrality of shame memories. Researchers and clinicians should distinguish between types of shame memory, particularly those where the self might have felt vulnerable and subordinate and perceived others as threatening and hostile, holding malevolent intentions towards the self.

Measuring Computer Performance: A Practitioner's Guide <=SEP=> A practitioner's guide Measuring computer performance sets out the fundamental techniques used in analyzing and understanding the performance of computer systems. Throughout the book, the emphasis is on practical methods of measurement, simulation and analytical modeling. The author discusses performance metrics and provides detailed coverage of the strategies used in benchmark programs. He gives intuitive explanations of the key statistical tools needed to interpret measured performance data. He also describes the generaìdesign of experiments' technique, and shows how the maximum amount of information can be obtained for the minimum effort. The book closes with a chapter on the technique of queueing analysis. Appendices listing common probability distributions and statistical tables are included, along with a glossary of important technical terms. This practically oriented book will be of great interest to anyone who wants a detailed, yet intuitive, understanding of computer systems performance analysis.

Successful lean implementation: Organizational culture and soft lean practices <=SEP=> Lean management (LM) is a managerial approach for improving processes based on a complex system of interrelated socio-technical practices. Recently, debate has centered on the role of organizational culture (OC) in LM. This paper aims to contribute to this debate by examining whether plants that successfully implement LM are characterized by a specific OC profile and extensively adopt soft LM practices. Data were analyzed from the High Performance Manufacturing (HPM) project dataset using a multi-group approach. The results revealed that a specific OC profile characterizes successful lean plants; in particular, when compared to unsuccessful lean plants, they show a higher institutional collectivism, future orientation, a humane orientation, and a lower level of assertiveness. While a high level of institutional collectivism, future orientation, and humane orientation are common features of high performers in general, a low level of assertiveness is typical only of successful lean plants. In addition, successful lean plants use soft LM practices more extensively than unsuccessful lean plants (i.e., lean practices concerning people and relations, such as small group problem solving, employees’ training to perform multiple tasks, supplier partnerships, customer involvement, and continuous improvement), while they do not differ significantly in terms of hard LM practices (i.e., lean technical and analytical tools). For managers, the results indicate that, in order to implement LM successfully, it is fundamental to go beyond LM technicalities by adopting soft practices and nurturing the development of an appropriate OC profile.

Two hearts in three-quarter time : How to waltz the social media / viral marketing dance <=SEP=> The concept of viral marketing has been discussed in the literature for over 15 years, since Jeffrey Rayport first introduced the term in 1996. However, the more widespread use of social media has recently pushed this idea to a whole new level. We provide insight into the relationship between social media and viral marketing, and illustrate the six steps executives should take in order to dance the social media/viral marketing waltz. We define viral marketing as electronic word-of-mouth whereby some form of marketing message related to a company, brand, or product is transmitted in an exponentially growing wayâ€”often through the use of social media applications. We consider the three conditions that need to be fulfilled to create a viral marketing epidemic (i.e., giving the right message to the right messengers in the right environment) and present four different groups of social media viral marketing campaigns (nightmares, strokes-of-luck, homemade issues, and triumphs). We conclude Purchase Export Previous article Next article Check if you have access through your login credentials or your institution.

A 5MHz, 24V-to-1.2V, AO2T current mode buck converter with one-cycle transient response and sensorless current detection for medical meters <=SEP=> With a stringent input-to-output conversion ratio (CR) of 20 (24V input and 1.2V output) for a DC-DC converter, two stage cascaded architectures are easy to implement, but suffer from poor efficiency and doubled number of power components. This paper presents a single-stage solution with a proposed Adaptive ON-OFF Time (AO2T) control. In steady state, the control works as an adaptive ON-time valley current mode control to accommodate the large CR. During load transient periods, both ON- and OFF-time are adaptively adjustable to instantaneous load change, in order to accomplish fast load transient response within one switching cycle. To facilitate the high speed current mode control, a sensorless current detection circuit is also proposed. Operating at 5MHz, the converter achieves a maximum efficiency of 89.8% at 700mA and an efficiency of 85% at 2A full load. During a load current slew rate of 1.8A/200ns, the undershoot/overshoot voltages at VO are 23mV and 37mV respectively.

Metamaterial-Substrate Antenna Array for MIMO Communication System <=SEP=> We demonstrate how a magnetic permeability enhanced metamaterial can enhance the antenna array of a multiple-input multiple-output(MIMO) communication system. The performance of a rectangular patch antenna array on a metamaterial substrate was studied relative to a similar array constructed on a conventional FR4 substrate. Differently spaced arrays were analytically compared using array correlation coefficients and mean effective gain as performance metrics. Achievable channel capacity were obtained through channel measurements made on a MIMO testbed. While results show that arrays on conventional FR4 substrates have higher capacity due to gain and efficiency factors, arrays can be made smaller, and have less mutual coupling and correlation coefficients, when using a metamaterial substrate, but the antenna built on the metamaterial substrate can be made more efficient through the use of better host materials. This was reflected in the analysis of both antenna arrays normalized to remove efficiency and gain differences where they showed similar performances. Hence, metamaterial substrates are a cost-effective solution when antenna miniaturization is a key design criteria compared to conventional substrates that achieve the same miniaturization factor without significantly sacrificing performance.

The Simpler The Better: A Unified Approach to Predicting Original Taxi Demands based on Large-Scale Online Platforms <=SEP=> Taxi-calling apps are gaining increasing popularity for their efficiency in dispatching idle taxis to passengers in need. To precisely balance the supply and the demand of taxis, online taxicab platforms need to predict the Unit Original Taxi Demand (UOTD), which refers to the number of taxi-calling requirements submitted per unit time (e.g., every hour) and per unit region (e.g., each POI). Predicting UOTD is non-trivial for large-scale industrial online taxicab platforms because both accuracy and flexibility are essential. Complex non-linear models such as GBRT and deep learning are generally accurate, yet require labor-intensive model redesign after scenario changes (e.g., extra constraints due to new regulations). To accurately predict UOTD while remaining flexible to scenario changes, we propose LinUOTD, a unified linear regression model with more than 200 million dimensions of features. The simple model structure eliminates the need of repeated model redesign, while the high-dimensional features contribute to accurate UOTD prediction. We further design a series of optimization techniques for efficient model training and updating. Evaluations on two large-scale datasets from an industrial online taxicab platform verify that LinUOTD outperforms popular non-linear models in accuracy. We envision our experiences to adopt simple linear models with high-dimensional features in UOTD prediction as a pilot study and can shed insights upon other industrial large-scale spatio-temporal prediction problems.

KeLP: a Kernel-based Learning Platform for Natural Language Processing <=SEP=> Kernel-based learning algorithms have been shown to achieve state-of-the-art results in many Natural Language Processing (NLP) tasks. We present KELP, a Java framework that supports the implementation of both kernel-based learning algorithms and kernel functions over generic data representation, e.g. vectorial data or discrete structures. The framework has been designed to decouple kernel functions and learning algorithms: once a new kernel function has been implemented it can be adopted in all the available kernelmachine algorithms. The platform includes different Online and Batch Learning algorithms for Classification, Regression and Clustering, as well as several Kernel functions, ranging from vector-based to structural kernels. This paper will show the main aspects of the framework by applying it to different NLP tasks.

Linear Machine Decision Trees <=SEP=> This article presents an algorithm for inducing multiclass decision trees with multivariate tests at internal decision nodes. Each test is constructed by training a linear machine and eliminating variables in a controlled manner. Empirical results demonstrate that the algorithm builds small accurate trees across a variety of tasks.

Biological network analysis and comparison: mining new biological knowledge <=SEP=> The mechanisms underlying life machinery are still not completely understood. Something is known, something is “probably” known, other things are still unknown. Scientists all over the world are working very hard to clarify the processes regulating the cell life cycle and bioinformaticians try to support them by developing specialized automated tools. Within the plethora of applications devoted to the study of life mechanisms, tools for the analysis and comparison of biological networks are catching the attention of many researchers. It is interesting to investigate why.

The Function of Fiction is the Abstraction and Simulation of Social Experience. <=SEP=> Fiction literature has largely been ignored by psychology researchers because its only function seems to be entertainment, with no connection to empirical validity. We argue that literary narratives have a more important purpose. They offer models or simulations of the social world via abstraction, simplification, and compression. Narrative fiction also creates a deep and immersive simulative experience of social interactions for readers. This simulation facilitates the communication and understanding of social information and makes it more compelling, achieving a form of learning through experience. Engaging in the simulative experiences of fiction literature can facilitate the understanding of others who are different from ourselves and can augment our capacity for empathy and social inference.

Machine Learning to Balance the Load in Parallel Branch-and-Bound <=SEP=> We describe in this paper a new approach to parallelize branchand-bound on a certain number of processors. We propose to split the optimization of the original problem into the optimization of several subproblems that can be optimized separately with the goal that the amount of work that each processor carries out is balanced between the processors, while achieving interesting speedups. The main innovation of our approach consists in the use of machine learning to create a function able to estimate the difficulty (number of nodes) of a subproblem of the original problem. We also present a set of features that we developed in order to characterize the encountered subproblems. These features are used as input of the function learned with machine learning in order to estimate the difficulty of a subproblem. The estimates of the numbers of nodes are then used to decide how to partition the original optimization tree into a given number of subproblems, and to decide how to distribute them among the available processors. The experiments that we carry out show that our approach succeeds in balancing the amount of work between the processors, and that interesting speedups can be achieved with little effort.

Cervical radiculopathy. <=SEP=> Cervical radiculopathy is the result of irritation and/or compression of nerve root as it exits the cervical spine. Pain is a common presenting symptom and may be accompanied by motor or sensory deficits in areas innervated by the affected nerve root. Diagnosis is suggested by history and corresponding physical examination findings. Confirmation is achieved with MRI. A multimodal approach to treatment helps patients improve. Medications may be used to alleviate symptoms and manage pain. Physical therapy and manipulation may improve neck discomfort. Guided corticosteroid injections and selected nerve blocks may help control nerve root pain. Most patients improve with a conservative, nonoperative treatment course.

Flower species recognition system using convolution neural networks and transfer learning <=SEP=> Automatic identification and recognition of medicinal plant species in environments such as forests, mountains and dense regions is necessary to know about their existence. In recent years, plant species recognition is carried out based on the shape, geometry and texture of various plant parts such as leaves, stem, flowers etc. Flower based plant species identification systems are widely used. While modern search engines provide methods to visually search for a query image that contains a flower, it lacks in robustness because of the intra-class variation among millions of flower species around the world. Hence in this proposed research work, a Deep learning approach using Convolutional Neural Networks (CNN) is used to recognize flower species with high accuracy. Images of the plant species are acquired using the built-in camera module of a mobile phone. Feature extraction of flower images is performed using a Transfer Learning approach (i.e. extraction of complex features from a pre-trained network). A machine learning classifier such as Logistic Regression or Random Forest is used on top of it to yield a higher accuracy rate. This approach helps in minimizing the hardware requirement needed to perform the computationally intensive task of training a CNN. It is observed that, CNN combined with Transfer Learning approach as feature extractor outperforms all the handcrafted feature extraction methods such as Local Binary Pattern (LBP), Color Channel Statistics, Color Histograms, Haralick Texture, Hu Moments and Zernike Moments. CNN combined with Transfer Learning approach yields impressive Rank-1 accuracies of 73.05%, 93.41% and 90.60% using OverFeat, Inception-v3 and Xception architectures, respectively as Feature Extractors on FLOWERS102 dataset.