• Title/Summary/Keyword: Filtering technique

Search Result 860, Processing Time 0.028 seconds

Personalized Movie Recommendation System Using Context-Aware Collaborative Filtering Technique (상황기반과 협업 필터링 기법을 이용한 개인화 영화 추천 시스템)

  • Kim, Min Jeong;Park, Doo-Soon;Hong, Min;Lee, HwaMin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.4 no.9
    • /
    • pp.289-296
    • /
    • 2015
  • The explosive growth of information has been difficult for users to get an appropriate information in time. The various ways of new services to solve problems has been provided. As customized service is being magnified, the personalized recommendation system has been important issue. Collaborative filtering system in the recommendation system is widely used, and it is the most successful process in the recommendation system. As the recommendation is based on customers' profile, there can be sparsity and cold-start problems. In this paper, we propose personalized movie recommendation system using collaborative filtering techniques and context-based techniques. The context-based technique is the recommendation method that considers user's environment in term of time, emotion and location, and it can reflect user's preferences depending on the various environments. In order to utilize the context-based technique, this paper uses the human emotion, and uses movie reviews which are effective way to identify subjective individual information. In this paper, this proposed method shows outperforming existing collaborative filtering methods.

The Ecology of the Scientific Literature and Information Retrieval (I)

  • Jeong, Jun-Min
    • Journal of the Korean Society for information Management
    • /
    • v.2 no.2
    • /
    • pp.3-37
    • /
    • 1985
  • This research deals with the problems encountered in designing systems for more efficient and effective information retrieval used in the proliferation of literature. This research was designed to develop and test 1) the partitioning a large bibliographic data base into quality oriented subsets (quality filtering), and 2) a system for effective and efficient information retrieval within subsets of data base (relevance). In order to accomplish this partitioning, the 'kernel' technique of graph theory was applied. In addition, a method of quality filtering utilizing the 'epidemic' theory and the 'obsolescence' of scientific literature was developed.

  • PDF

The Ecology of the Scientific Literature and Information Retrieval (II)

  • Jeong, Jun-Min
    • Journal of the Korean Society for information Management
    • /
    • v.3 no.1
    • /
    • pp.3-16
    • /
    • 1986
  • This research deals with the problems encountered in designing systems for more efficient and effective information retrieval used in the proliferation of literature. This research was designed to develop and test 1) the partitioning a large bibliographic data base into quality oriented subsets (quality filtering), and 2) a system for effective and efficient Information retrieval within subsets of data base (relevance). In order to accomplish this partitioning, the 'kernel' technique of graph theory was applied. In addition, a method of quality filtering utilizing the 'epidemic' theory and the 'obsolescence' of scientific literature was developed.

  • PDF

Scalable Collaborative Filtering Technique based on Adaptive Clustering (적응형 군집화 기반 확장 용이한 협업 필터링 기법)

  • Lee, O-Joun;Hong, Min-Sung;Lee, Won-Jin;Lee, Jae-Dong
    • Journal of Intelligence and Information Systems
    • /
    • v.20 no.2
    • /
    • pp.73-92
    • /
    • 2014
  • An Adaptive Clustering-based Collaborative Filtering Technique was proposed to solve the fundamental problems of collaborative filtering, such as cold-start problems, scalability problems and data sparsity problems. Previous collaborative filtering techniques were carried out according to the recommendations based on the predicted preference of the user to a particular item using a similar item subset and a similar user subset composed based on the preference of users to items. For this reason, if the density of the user preference matrix is low, the reliability of the recommendation system will decrease rapidly. Therefore, the difficulty of creating a similar item subset and similar user subset will be increased. In addition, as the scale of service increases, the time needed to create a similar item subset and similar user subset increases geometrically, and the response time of the recommendation system is then increased. To solve these problems, this paper suggests a collaborative filtering technique that adapts a condition actively to the model and adopts the concepts of a context-based filtering technique. This technique consists of four major methodologies. First, items are made, the users are clustered according their feature vectors, and an inter-cluster preference between each item cluster and user cluster is then assumed. According to this method, the run-time for creating a similar item subset or user subset can be economized, the reliability of a recommendation system can be made higher than that using only the user preference information for creating a similar item subset or similar user subset, and the cold start problem can be partially solved. Second, recommendations are made using the prior composed item and user clusters and inter-cluster preference between each item cluster and user cluster. In this phase, a list of items is made for users by examining the item clusters in the order of the size of the inter-cluster preference of the user cluster, in which the user belongs, and selecting and ranking the items according to the predicted or recorded user preference information. Using this method, the creation of a recommendation model phase bears the highest load of the recommendation system, and it minimizes the load of the recommendation system in run-time. Therefore, the scalability problem and large scale recommendation system can be performed with collaborative filtering, which is highly reliable. Third, the missing user preference information is predicted using the item and user clusters. Using this method, the problem caused by the low density of the user preference matrix can be mitigated. Existing studies on this used an item-based prediction or user-based prediction. In this paper, Hao Ji's idea, which uses both an item-based prediction and user-based prediction, was improved. The reliability of the recommendation service can be improved by combining the predictive values of both techniques by applying the condition of the recommendation model. By predicting the user preference based on the item or user clusters, the time required to predict the user preference can be reduced, and missing user preference in run-time can be predicted. Fourth, the item and user feature vector can be made to learn the following input of the user feedback. This phase applied normalized user feedback to the item and user feature vector. This method can mitigate the problems caused by the use of the concepts of context-based filtering, such as the item and user feature vector based on the user profile and item properties. The problems with using the item and user feature vector are due to the limitation of quantifying the qualitative features of the items and users. Therefore, the elements of the user and item feature vectors are made to match one to one, and if user feedback to a particular item is obtained, it will be applied to the feature vector using the opposite one. Verification of this method was accomplished by comparing the performance with existing hybrid filtering techniques. Two methods were used for verification: MAE(Mean Absolute Error) and response time. Using MAE, this technique was confirmed to improve the reliability of the recommendation system. Using the response time, this technique was found to be suitable for a large scaled recommendation system. This paper suggested an Adaptive Clustering-based Collaborative Filtering Technique with high reliability and low time complexity, but it had some limitations. This technique focused on reducing the time complexity. Hence, an improvement in reliability was not expected. The next topic will be to improve this technique by rule-based filtering.

Image Restoration Using Directional Multistage Morphological Filter (방향성 다중 모폴로지컬 필터를 이용한 영상 복원)

  • 배재휘;최진수;심재창;하영호
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.9
    • /
    • pp.76-83
    • /
    • 1993
  • A morphological filtering algorithm using directional information is presented. Directional filtering technique is effective in reducing noises and preserving edges. The proposed directional filtering is composed of two stage filtering processes. The opening and closing operations in the lst stage are performed for the pixels is aligned to the vertical, horizontal, and two diagonal directions, respectively. The opening operation supresses the positive impulse noises, while the closing operation the negative ones. Then, each directional result and their average value are filtered by the opening or closing operations in the 2nd stage. The averaging operation diminishes the effects of Gaussian noises in the homogeneous regions. Thus, the morphological operation in the 1 st stageremoves the impulse noises and in 2nd stage reduces. Gaussian ones. The experimental results show that the proposed filtering is superior to the existing nonlinear filtering in the aspects of the subjective quality. Also, the morphological filtering method reduces the computational loads.

  • PDF

An Approach to Credibility Enhancement of Automated Collaborative Filtering System through Accommodating User's Rating Behavior

  • Sung, Jang-Hwan;Park, Jong-Hun
    • 한국경영정보학회:학술대회논문집
    • /
    • 2007.06a
    • /
    • pp.576-581
    • /
    • 2007
  • The purpose of this paper is to strengthen trust on the automated collaborative filtering system. Automated collaborative filtering system is quickly becoming a popular technique for recommendation system. This elaborative methodology contributes for reducing information overload and the result becomes index of users' preference. In addition, it can be applied to various industries in various fields. After it collaborative filtering system was developed, many researches are executed to enhance credibility and to apply in various fields. Among these diverse systems, collaborative filtering system which uses Pearson correlation coefficient is most common in many researches. In this paper, we proposed new process diagram of collaborative filtering algorithm and new factors which should improve the credibility of system. In addition, the effects and relationships are also tested.

  • PDF

Comparison of Recommendation Using Social Network Analysis with Collaborative Filtering in Social Network Sites (SNS에서 사회연결망 기반 추천과 협업필터링 기반 추천의 비교)

  • Park, Sangun
    • Journal of Information Technology Services
    • /
    • v.13 no.2
    • /
    • pp.173-184
    • /
    • 2014
  • As social network services has become one of the most successful web-based business, recommendation in social network sites that assist people to choose various products and services is also widely adopted. Collaborative Filtering is one of the most widely adopted recommendation approaches, but recommendation technique that use explicit or implicit social network information from social networks has become proposed in recent research works. In this paper, we reviewed and compared research works about recommendation using social network analysis and collaborative filtering in social network sites. As the results of the analysis, we suggested the trends and implications for future research of recommendation in SNSs. It is expected that graph-based analysis on the semantic social network and systematic comparative analysis on the performances of social filtering and collaborative filtering are required.

A Fuzzy Logic Based Bin-Picking Technique (퍼지노리를 이용한 Bin-Picking방법)

  • 김태원;서일홍
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.41 no.8
    • /
    • pp.938-946
    • /
    • 1992
  • A novel 2-dimensional matched filter of the parallel-jaw type using fuzzy logic is proposed for bin picking. Specifically, the averaged pixel intensity of the windowed region for the filtering is considered to be fuzzy. Also membership functions for darkness and brightness are designed by employing the intensity histogram of the image. Then a rule is given to know how much a windowed region can be a possible holdsite. Furthermore eight rules are made to determine the part orientation, where Mamdani's reasoning method is applied. The proposed technique shows better performances than that of the conventional matched filtering technique in the following senses` 1) most of holdsites determined by the proposed technique are not concentrated at the locations nearly the end of part and 2) our filter is rather insensitive to noises than the conventional method. To show the validities of our proposed technique, some experimental results are illustrated and compared with the results by conventional matched filter technique.

  • PDF

Filtering Random Noise from Deterministic Underwater Signals via Application on an Artificial neural Network

  • Na, Young-Nam;Park, Joung-Soo;Choi, Jae-Young;Kim, Chun-Duck
    • The Journal of the Acoustical Society of Korea
    • /
    • v.15 no.3E
    • /
    • pp.4-12
    • /
    • 1996
  • In this study, we examine the applicability of an artificial neural network(ANN) for filtering underwater random noise and for identifying underlying signals taken from noisy environment. The approach is to find a way of compressing the input data and then decompressing it using an ANN as in image compressing process. It is well known that random signal is hard to compress while ordered information is not. The use of a limited number of processing elements(PEs) in the hidden layer of an Ann ensures that some of the noise would be removed in the reconstruction process. Two types of the signals, synthesized and measured, are used to examine the effectiveness of the ANN-based filter. After training process is completed, the ANN successfully extracts the underlying signals form the synthesized or measured noisy signals. In particular, compared with the results form without filtering or moving averaged, the ANN-based filter gives much better spectrograms to identify underlying signals from the measured noisy data. This filtering process is achieved without using and kind of highly accurate signal processing technique. More experimentation needs to be followed to develop the ANN-based filtering technique to the level of complete understanding.

  • PDF

Design of a High-Speed RFID Filtering Engine and Cache Based Improvement (고속 RFID 필터링 엔진의 설계와 캐쉬 기반 성능 향상)

  • Park Hyun-Sung;Kim Jong-Deok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.5A
    • /
    • pp.517-525
    • /
    • 2006
  • In this paper, we present a high-speed RFID data filtering engine designed to carry out filtering under the conditions of massive data and massive filters. We discovered that the high-speed RFID data filtering technique is very similar to the high-speed packet classification technique which is used in high-speed routers and firewall systems. Actually, our filtering engine is designed based on existing packet classification algorithms, Bit Parallelism and Aggregated Bit Vector(ABV). In addition, we also discovered that there are strong temporal relations and redundancy in the RFID data filtering operations. We incorporated two kinds of caches, tag and filter caches, to make use of this characteristic to improve the efficiency of the filtering engine. The performance of the proposed engine has been examined by implementing a prototype system and testing it. Compared to the basic sequential filter comparison approach, our engine shows much better performance, and it gets better as the number of filters increases.