A content-based goods image recommendation system

The information of e-commerce images varies and different users may focus on different contents of the same image for different purpose. So the research on recommendation by computers is becoming more and more important. But retrieval based only on keywords obviously falls short for massive numbers of resource images. In this paper, we focus on a recommendation system of goods images based on image content. Goods images have a relatively homogenous background and have a wide range of applications. The recommendation consists of three stages. First, the image is pre-processed by removing the background. Second, a weighted representation model is proposed to represent the image. The separated features are extracted and normalized, and then the weights of each feature are computed based on the samples browsed by the users. Third, a feature indexing scheme is put forward based on the proposed representation. A binary-tree is used for the indexing, and a binary-tree updating algorithm is also given. Finally, the recommended images are given by a features combination searching scheme. Experimental results on a real goods image database show that our algorithm can achieve high accuracy in recommending similar goods images with high speed.     

An effective content-based event recommendation model

Event-based social networks (EBSNs) facilitate people to interact with each other by sharing similar interests in online groups or taking part in offline events together. Event recommendation in EBSNs has been studied by many researchers. However, the problem of recommending the event to the top N active-friends of the key user has rarely been studied in EBSNs. In this paper, we propose a new method to solve this problem. In this method, we first construct an association matrix from the content of events and user features. Then, we define a new content-based event recommendation model, which combines the matrix, spatio-temporal relations and user interests to recommend an event to the active-friends of a key user. A series of experiments were conducted on real datasets collected from Meetup, and the comparison results have demonstrated the effectiveness of the new model.

     

A content-based recommendation algorithm for learning resources

Automatic multimedia learning resources recommendation has become an increasingly relevant problem: it allows students to discover new learning resources that match their tastes, and enables the e-learning system to target the learning resources to the right students. In this paper, we propose a content-based recommendation algorithm based on convolutional neural network (CNN). The CNN can be used to predict the latent factors from the text information of the multimedia resources. To train the CNN, its input and output should first be solved. For its input, the language model is used. For its output, we propose the latent factor model, which is regularized by L₁-norm. Furthermore, the split Bregman iteration method is introduced to solve the model. The major novelty of the proposed recommendation algorithm is that the text information is used directly to make the content-based recommendation without tagging. Experimental results on public databases in terms of quantitative assessment show significant improvements over conventional methods. In addition, the split Bregman iteration method which is introduced to solve the model can greatly improve the training efficiency.     

Solving distribution problems in content-based recommendation system with gaussian mixture model

Applied Intelligence - Recommendation systems play an important role in boosting purchasing consumption for many manufacturers by helping consumers find the most appropriate items. Furthermore,...     

Comparison of content-based music recommendation using different distance estimation methods

With rapid growth in the online music market, music recommendation has become an active research area. In most current approaches, content-based recommendation methods play an important role. Estimation of similarity between music content is the key to these approaches. A distance formula is used to calculate the music distance measure, and music recommendations are provided based on this measure. However, people have their own unique tastes in music. This paper proposes a method to calculate a personalized distance measure between different pieces of music based on user preferences. These methods utilize a randomized algorithm, a genetic algorithm, and genetic programming. The first two methods are based on Euclidean distance calculation, where the weight of each music feature in the distance calculation approximates user perception. The third method is not limited to Euclidean distance calculation. It generates a more complex distance function to estimate a user’s music preferences. Experiments were conducted to compare the distance functions calculated by the three methods, and to compare and evaluate their performance in music recommendation.     

Localized content-based image retrieval

We define localized content-based image retrieval as a CBIR task where the user is only interested in a portion of the image, and the rest of the image is irrelevant. In this paper we present a localized CBIR system, Accio, that uses labeled images in conjunction with a multiple-instance learning algorithm to first identify the desired object and weight the features accordingly, and then to rank images in the database using a similarity measure that is based upon only the relevant portions of the image. A challenge for localized CBIR is how to represent the image to capture the content. We present and compare two novel image representations, which extend traditional segmentation-based and salient point-based techniques respectively, to capture content in a localized CBIR setting.     

Association and content-based retrieval

In spite of important efforts in content-based indexing and retrieval during these last years, seeking relevant and accurate images remains a very difficult query. In the state-of-the-art approaches, the retrieval task may be efficient for some queries in which the semantic content of the query can be easily translated into visual features. For example, finding images of fires is simple because fires are characterized by specific colors (yellow and red). However, it is not efficient in other application fields in which the semantic content of the query is not easily translated into visual features. For example, finding images of birds during migrations is not easy because the system has to understand the query semantic. In the query, the basic visual features may be useful (a bird is characterized by a texture and a color), but they are not sufficient. What is missing is the generalization capability. Birds during migrations belong to the same repository of birds, so they share common associations among basic features (e.g., textures and colors) that the user cannot specify explicitly. We present an approach that discovers hidden associations among features during image indexing. These associations discriminate image repositories. The best associations are selected on the basis of measures of confidence. To reduce the combinatory explosion of associations, because images of the database contain very large numbers of colors and textures, we consider a visual dictionary that group together similar colors and textures.     

Adaptive content-based music retrieval system

This paper presents a tunable content-based music retrieval (CBMR) system suitable the for retrieval of music audio clips. The audio clips are represented as extracted feature vectors. The CBMR system is expert-tunable by altering the feature space. The feature space is tuned according to the expert-specified similarity criteria expressed in terms of clusters of similar audio clips. The main goal of tuning the feature space is to improve retrieval performance, since some features may have more impact on perceived similarity than others. The tuning process utilizes our genetic algorithm. The R-tree index for efficient retrieval of audio clips is based on the clustering of feature vectors. For each cluster a minimal bounding rectangle (MBR) is formed, thus providing objects for indexing. Inserting new nodes into the R-tree is efficiently performed because of the chosen Quadratic Split algorithm. Our CBMR system implements the point query and the n-nearest neighbors query with the O(logn) time complexity. Different objective functions based on cluster similarity and dissimilarity measures are used for the genetic algorithm. We have found that all of them have similar impact on the retrieval performance in terms of precision and recall. The paper includes experimental results in measuring retrieval performance, reporting significant improvement over the untuned feature space.     

Learning similarity matching in multimedia content-based retrieval

Many multimedia content-based retrieval systems allow query formulation with the user setting the relative importance of features (e.g., color, texture, shape, etc.) to mimic the user's perception of similarity. However, the systems do not modify their similarity matching functions, which are defined during the system development. We present a neural network-based learning algorithm for adapting the similarity matching function toward the user's query preference based on his/her relevance feedback. The relevance feedback is given as ranking errors (misranks) between the retrieved and desired lists of multimedia objects. The algorithm is demonstrated for facial image retrieval using the NIST Mugshot Identification Database with encouraging results     

推荐系统中推荐池的聚类算法分析

针对个性化推荐系统规模扩大而引起的实时性差、推荐精度较低等问题,提出了改进的k-均值用户聚类算法,实现对推荐系统中推荐池的压缩,将用户在不同项目簇上的评价差异作为用户距离,采用kruskal最小生成树算法生成初始聚类中心,使得初始中心靠近类中心,这样得到的聚类更符合实际.进行了算法改进前后的实验对比,结果表明,改进的聚...     

Using relevance feedback in content-based image metasearch

MetaSeek is an image metasearch engine developed to explore the querying of large, distributed, online visual information systems. The current implementation integrates user feedback into a performance-ranking mechanism. MetaSeek selects and queries the target image search engines according to their success under similar query conditions in previous searches. The current implementation keeps track of each target engine's performance by integrating user feedback for each visual query into a performance database. We begin with a review of the issues in content-based visual query, then describe the current MetaSeek implementation. We present the results of experiments that evaluated the implementation in comparison to a previous version of the system and a baseline engine that randomly selects the individual search engines to query. We conclude by summarizing open issues for future research     

Qualitative part-based models in content-based image retrieval

A qualitative, volumetric part-based model is proposed to improve the categorical invariance and viewpoint invariance in content-based image retrieval, and a novel two-step part-categorization method is presented to build it. The method consists first in transforming parts extracted from a segmented contour primitive map and then categorizing the transformed parts using interpretation rules. The first step allows noisy extracted parts to be transformed to the domain of a simple classifier. The second step computes features of the transformed parts for categorization. Content-based image retrieval experiments using real images of complex multi-part objects confirm that a model built from the categorized parts improves both the categorical invariance and the viewpoint invariance. It does so by directly addressing the fundamental limits of low-level models.     

基于内容分发的Cache集群系统

文章设计和实现了大规模基于内容请求分发的系统。一个VS／DR或VS／TUN调度器作为系统的单一入口点，将请求分发给一组KTCPVS分发器，KTCPVS分发器通过使用中心的内容位置服务来确定处理该请求的后端服务器，然后，再将该请求分发到后端服务器，并提出基于局部性的最小负载调度算法。最后将该体系结构应用到大规模Cache集群系统中加以验证。     

Image content-based retrieval using chromaticity moments

A number of different approaches have been recently presented for image retrieval using color features. Most of these methods use the color histogram or some variation of it. If the extracted information is to be stored for each image, such methods may require a significant amount of space for storing the histogram, depending on a given image's size and content. In the method proposed, only a small number of features, called chromaticity moments, are required to capture the spectral content (chrominance) of an image. The proposed method is based on the concept of the chromaticity diagram and extracts a set of two-dimensional moments from it to characterize the shape and distribution of chromaticities of the given image. This representation is compact (only a few chromaticity moments per image are required) and constant (independent of image size and content), while its retrieval effectiveness is comparable to using the full chromaticity histogram.     

Complementary relevance feedback-based content-based image retrieval

We propose a complementary relevance feedback-based content-based image retrieval (CBIR) system. This system exploits the synergism between short-term and long-term learning techniques to improve the retrieval performance. Specifically, we construct an adaptive semantic repository in long-term learning to store retrieval patterns of historical query sessions. We then extract high-level semantic features from the semantic repository and seamlessly integrate low-level visual features and high-level semantic features in short-term learning to effectively represent the query in a single retrieval session. The high-level semantic features are dynamically updated based on users’ query concept and therefore represent the image’s semantic concept more accurately. Our extensive experimental results demonstrate that the proposed system outperforms its seven state-of-the-art peer systems in terms of retrieval precision and storage space on a large scale imagery database.     

In-memory,distributed content-based recommender system

Burdened by their popularity, recommender systems increasingly take on larger datasets while they are expected to deliver high quality results within reasonable time. To meet these ever growing requirements, industrial recommender systems often turn to parallel hardware and distributed computing. While the MapReduce paradigm is generally accepted for massive parallel data processing, it often entails complex algorithm reorganization and suboptimal efficiency because mid-computation values are typically read from and written to hard disk. This work implements an in-memory, content-based recommendation algorithm and shows how it can be parallelized and efficiently distributed across many homogeneous machines in a distributed-memory environment. By focusing on data parallelism and carefully constructing the definition of work in the context of recommender systems, we are able to partition the complete calculation process into any number of independent and equally sized jobs. An empirically validated performance model is developed to predict parallel speedup and promises high efficiencies for realistic hardware configurations. For the MovieLens 10 M dataset we note efficiency values up to 71 % for a configuration of 200 computing nodes (eight cores per node).     

基于内容识别的Web集群负载均衡算法的研究

可扩展Web服务器集群是目前高性能网络服务器的主要架构方法,负载均衡技术是集群系统中任务分配的核心环节.提出了一种基于内容识别的负载均衡算法,引入了访问量阈值的概念,并通过动态的修正访问量阈值以适应网络负载的变化;利用动态反馈机制来获取服务器的负载状态,同时通过保证负载的局部性,减少相同内容在多个服务器中的重复缓存,提高服务器Cache的命中率.     

A content-based deep intrusion detection system

International Journal of Information Security - The growing number of Internet users and the prevalence of web applications make it necessary to deal with very complex software and applications in...