Korean | English

pISSN : 1598-849X / eISSN : 2383-9945

2020 KCI Impact Factor : 0.4
Home > Explore Content > All Issues > Article List

2006, Vol.11, No.1

  • 1.

    A Genetic Approach for Dynamic Load Redistribution in Heterogeneous Distributed Systems

    Lee Seong Hoon | HAN KUN-HEE | 2006, 11(1) | pp.1~10 | number of Cited : 1
    Abstract PDF
    Load redistribution algorithm is a critical factor in computer system. In a receiver -initiated load redistribution algorithm, receiver(underloaded processor) continues to send unnecessary request messages for load transfer until a sender(overloaded processor) is found while the system load is light. Therefore, it yields many problems such as low CPU utilization and system throughput because of inefficient inter-processor communications until the receiver receives an accept message from the sender in this environment. This paper presents an approach based on genetic algorithm(GA) for dynamic load redistribution in heterogeneous distributed systems. In this scheme the processors to which the requests are sent off are determined by the proposed GA to decrease unnecessary request messages.
  • 2.

    Optimization-Based Pattern Generation for LAD

    장인용 | RYOO, Hong Seo | 2006, 11(1) | pp.11~18 | number of Cited : 1
    Abstract PDF
    The logical analysis of data(LAD) is a Boolean-logic based data mining tool. A critical step in analyzing data by LAD is the pattern generation stage where useful knowledge and hidden structural information in data is discovered in the form of patterns. A conventional method for pattern generation in LAD is based on term enumeration that renders the generation of higher degree patterns practically impossible. In this paper, we present a novel optimization-based pattern generation methodology and propose two mathematical programming models, a mixed 0-1 integer and linear programming (MILP) formulation and a well-studied set covering problem (SCP) formulation for the generation of optimal and heuristic patterns, respectively. With benchmark datasets, we demonstrate the effectiveness of our models by automatically generating with ease patterns of high complexity that cannot be generated with the conventional approach.
  • 3.

    The Study on Searching Algorithm of the center of Pupil for the Iris Recognition

    JO, MIN HWAN | Hur,Jung-Yeon | 2006, 11(1) | pp.19~26 | number of Cited : 0
    Abstract PDF
    Iris recognition is a bio metric personal identification which uses iris pattern of the pupil, and it is recognized as one of the best technology in personal identification and information security field. Before iris recognition, it is very important to search center of pupil. In recent years, there was developed many searching algorithms of center of pupil, but all most method are too many processing time. In this paper, we proposed a new method for searching center of pupil. This method is greatly reduced processing time about 30 % compared with other algorithm using Hough transformation.
  • 4.

    Design and Implementation of Spatial Associatio Rule Discovery System for Spatial Data Analysis

    이윤석 | JUHONG LEE | 안찬민 and 1other persons | 2006, 11(1) | pp.27~34 | number of Cited : 0
    Abstract PDF
    Recently, the study about the technology which effectively manage spatial information is actively conducted. For the effective knowledge inquiry, various extended data mining methods are applied in spatial data mining. However, former spatial association rule system appears the problem that does not reflect various non-spatial property along the inquiries because it searches the rule from the calculation among predicates. To resolve the problem, present study suggests the system that extends the inquiries using in spatial database, searches the association rule among non-spatial object property after setting the data based on space information. Especially, the model which is applicable to geographical information system is embodied. Embodied system with this method enables to search more useful spatial association rule in real life since it shows high migration property with extended spatial database and considers spatial property and various non-spatial property.
  • 5.

    A Study on CRL Distributing Method based on Group Key Agreement in D-OCSP

    Ho Lee | Hyun-Joong Kang | 박준홍 | 2006, 11(1) | pp.35~44 | number of Cited : 2
    Abstract PDF
    As the E-commerce and E-business are developed actively, using certificate is incremented rapidly. The certificate validation must be confirmed at first in E-commerce and the OCSP Responder can offer CSI to the client using OCSP. With the rapid development of the E-commerce based on the Internet, a lot of clients request CSI to OCSP Responder. So, the load to OCSP Responder is increased and the OCSP Responder may be overloaded. Therefore, for distributing the load to an OCSP Responder, D-OCSP is introduced. As the CRL has a lot of information about revoked certificates and have a high exposure possibility of information in the process of distribution, the confidentiality as well as integrity are required in the process of distribution. So, we propose a CRL distributing method based on group key agreement in D-OCSP. The proposed method can distribute effectively a published CRL to OCSP Responders with confidentiality as well as integrity and offer concurrency that each OCSP Responder can start CSI servicing of new CRL to clients at the same time.
  • 6.

    카이제곱 NHPP에 의한 소프트웨어 신뢰성 모형에 관한 연구

    Kim Hee Chul | 2006, 11(1) | pp.45~54 | number of Cited : 9
    Abstract PDF
    Finite failure NHPP models presented in the literature exhibit either constant, monotonic increasing or monotonic decreasing failure occurrence rates per fault. In this paper, Goel-Okumoto and Yamada-Ohba-Osaki model was reviewed, proposes the reliability model, which can capture the increasing nature of the failure occurrence rate per fault. Algorithm to estimate the parameters used to maximum likelihood estimator and bisection method, model selection based on SSE, AIC statistics and Kolmogorov distance, for the sake of efficient model, was employed. Analysis of failure using real data set, SYS2(Allen P.Nikora and Michael R.Lyu), for the sake of proposing shape parameter of the distribution using the degree of freedom, was employed. This analysis of failure data compared with the model and the existing model using arithmetic and Laplace trend tests, Kolmogorov test is presented.
  • 7.

    The Research for Generating Independent Multimedia Title in Display Environment

    DaeHyuck Park | Euisun Kang | Maria Hong and 2other persons | 2006, 11(1) | pp.55~62 | number of Cited : 0
    Abstract PDF
    Multimedia title needs player that depends upon operate system. This raises problems of data compatibility and resource consumption by overlapping development of player. To solve problems, we propose a method which produce multimedia title contents to internet document and then display on internet browser. Contents in multimedia title are transcoded to internet pages, having greate quality, based on CSS Layer for spatial synchronization of multimedia data. This method converts existing DB into XML for multimedia title including personal information. Therefore, XML data and resource information is playable by private multimedia player. Consequently, user can display multimedia content without player using internet browser in anytime.
  • 8.

    The method of Deciding PC Web Important Image for Mobile Web Service

    박대혁 | Maria Hong | Seo Jeong-Man and 2other persons | 2006, 11(1) | pp.63~70 | number of Cited : 1
    Abstract PDF
    There are many new studies on the contents for mobile devices that are all connected to networks in a seemingly ubiquitous environment. The purpose of this paper is to propose a framework for obtaining Internet content intended for computers on mobile devices. In other words, the primary concern of this paper is to select the best images for optimal performance and convert them into images that can be effectively reproduced on mobile devices. For this, the performance of the server is to be optimized through selecting high-priority images among the many available images and converting them while considering the display pixel rates (DPR) and the image distribution areas.
  • 9.

    A Study on Determination of the Number of Work Processes Reflecting Characteristics of Program on Computational Grid

    조수현 | Kim Young Hak | 2006, 11(1) | pp.71~86 | number of Cited : 4
    Abstract PDF
    The environment of computational grid is composed of the LAN/WAN each of which has different efficiency and heterogeneous network conditions, and where various programs are running. In this environment, the role of the resource selection broker is very important because the work of each node is performed by considering heterogeneous network environment and the computing power of each node according to the characteristics of a program. In this paper, a new resource selection broker is presented that decides the number of work processes to be allocated at each node by considering network state information and the performance of each node according to the characteristics of a program in the environment of computational grid. The proposed resource selection broker has three steps as follows. First, the performance ratio of each node is computed using latency-bandwidth-cpu mixture information reflecting the characteristics of a program, and the number of work processes that will be performed at each node are decided by this ratio. Second, RSL file is automatically made based on the number of work processes decided at the previous step. Finally, each node creates work processes by using that RSL file and performs the work which has been allocated to itself. As experimental results, the proposed method reflecting characteristics of a program, compared with the existing (uniformity) and latency-bandwidth method is improved 278%~316%, 524%~595%, 924% ~954% in the point of work amount, work process number, and node number respectively.
  • 10.

    A Selectivity Estimation Technique for Current Query of Moving Objects

    Jeong Hee Chi | RYU KEUN HO | JUNG DOO YOUNG | 2006, 11(1) | pp.87~96 | number of Cited : 0
    Abstract PDF
    Selectivity estimation is one of the query optimization techniques. It is difficult for the previous selectivity estimation techniques for moving objects to apply the position change of moving objects to synopsis. Therefore, they result in much error when estimating selectivity for queries, because they are based on the extended spatial synopsis which does not consider the property of the moving objects. In order to reduce the estimation error, the existing techniques should often rebuild the synopsis. Consequently problem occurs, that is, the whole database should be read frequently. In this paper, we proposed a moving object histogram method based on quad tree to develop a selectivity estimation technique for moving object queries. We then analyzed the performance of the proposed method through the implementation and evaluation of the proposed method. Our method can be used in various location management systems such as vehicle location tracking systems, location based services, telematics services, emergency rescue service, etc in which the location information of moving objects changes over time.
  • 11.

    A Spatial Index Compression Scheme Using Semi-Approximation

    Jongwan Kim | 2006, 11(1) | pp.97~106 | number of Cited : 0
    Abstract PDF
    Over the last several years, studies on spatial index have increased in proportion to the increase in the spatial data. Most of these studies, however, were on the indices based on R-tree by adding or changing some options, and there are a few studies on how to increase the search performance of the spatial data by compressing an MBR. This study was conducted in order to propose a new MBR compression scheme, SA(Semi- Approximation). The basic idea of this paper is the compression of MBRs in a spatial index. Since SA decreases the keys of MBRs, the enlargements of QMBR in half and increases the utilization of nodes, the SA heightens the overall search performance. The study analyzes mathematically the number of node accesses in a 2D space and evaluates the performance of the SA using the real data on location information. The results show that the proposed scheme has increased performance, higher than that of the pre-established schemes on compression of MBR.
  • 12.

    ?A Study on Intermediated code for Analyzing Bytecodes

    KIM KYUNG SU | Weon Hee Yoo | 2006, 11(1) | pp.107~118 | number of Cited : 1
    Abstract PDF
    Java language creates class files through Java compiler. Class files include informations involved with achievement of program. We can do analysis and optimization for efficient codes by analyzing class files. This paper analyzes bytecodes using informations of Java class files. We translate stack-based Java bytecodes into 3-address codes. Then we translate into static single assignment form using the 3-address codes. Static single assignment form provides a compact representation of a variable's definition-use information. Static single assignment form is often used as an intermediate representation during code optimization. Static single assignment form renames each occurrence of a variable such that each variable is defined only once.
  • 13.

    A Study on Selective Control System for Web-Based Courseware Design

    Kim Mee-Kyung | JUHONG LEE | 강윤희 | 2006, 11(1) | pp.119~128 | number of Cited : 0
    Abstract PDF
    The web based coursewares that are operating currently can not support individual studying capabilities appropriately. To solve this problem, this paper can provide individual students with a tool that makes contents of lessons to be organized according to study subjects, study objective, and study scope by students. And it is designed for study contents to be condensed into a courseware and be operated in a courseware. Also this method can continuously stimulate a study motivation by providing selective control system without a predefined linear study plan. And it also can have the contents of study coincide with their interests and needs. Therefore this method maximizes accomplishments for the study contents and satisfaction for way of study.
  • 14.

    Neighborhood Search Algorithms for the Maximal Covering Problem

    Hwang Junha | 2006, 11(1) | pp.129~138 | number of Cited : 1
    Abstract PDF
    Various techniques have been applied to solve the maximal covering problem. Tabu search is also one of them. But, existing researches were lacking of the synthetic analysis and the effort for performance improvement about neighborhood search techniques such as hill-climbing search and simulated annealing including tabu search. In this paper, I introduce the way to improve performance of neighborhood search techniques through various experiments and analyses. Basically, all neighborhood search algorithms use the k-exchange neighborhood generation method. And I analyzed how the performance of each algorithm changes according to various parameter settings. Experimental results have shown that simple hill-climbing search and simulated annealing can produce better results than any other techniques. And I confirmed that simple hill-climbing search can produce similar results as simulated annealing unlike general case.
  • 15.

    Effective Nonlinear Filters with Visual Perception Characteristics for Extracting Sketch Features

    조성목 | 조옥래 | 2006, 11(1) | pp.139~146 | number of Cited : 1
    Abstract PDF
    Feature extraction technique in digital images has many applications such as robot vision, medical diagnostic system, and motion video transmission, etc. There are several methods for extracting features in digital images for example nonlinear gradient, nonlinear laplacian, and entropy convolutional filter. However, conventional convolutional filters are usually not efficient to extract features in an image because image feature formation in eyes is more sensitive to dark regions than to bright regions. A few nonlinear filters using difference between arithmetic mean and harmonic mean in a window for extracting sketch features are described in this paper. They have some advantages, for example simple computation, dependence on local intensities and less sensitive to small intensity changes in very dark regions. Experimental results demonstrate more successful features extraction than other conventional filters over a wide variety of intensity variations.
  • 16.

    Improved Hierarchical Prefix Delegation Protocol for route optimization in nested NEMO

    Rho, KyungTaeg | 2006, 11(1) | pp.147~156 | number of Cited : 0
    Abstract PDF
    Hierarchical Prefix Delegation (HPD) protocol refers to a type of solution to problems inherent in non-optimal routing which occurs with Network Mobility (NEMO) basic solution. However, because HPD cannot improve the micro-mobility problems, problem surfaces each time Mobile Network Node (MNN) changes the attachment point; as happens also in a Mobile IPv6 (MIPv6) protocol in sending Binding Update (BU) messages to Home Agent (HA) / Correspondent Nodes(CNs). By applying Hierarchical Mobile IPv6 protocol concept to HPD, this study proposes an algorithm for effectively handling micro-mobility problems which occur with HPD in a nested NEMO environment. By sending BU only to nearby Mobility Anchor Point(MAP) during MNN location change within a MAP's domain, the proposed protocol will alleviate service disruption delays and signaling loads during the handover process, overcoming the limitations of HPD.
  • 17.

    A Study on Multicast ATM Switch with Tandem Crosspoints

    Kim,Hong-Ryul | 2006, 11(1) | pp.157~166 | number of Cited : 0
    Abstract PDF
    This paper proposes a new output-buffered multicast ATM switch with tandem crosspoints switching fabric, named the MTCOS(Multicast Tandem Crosspoint Output- buffered Switch). The MTCOS consists of multiple simple crosspoint switch fabrics, named TCSF(Tandem Crosspoint Switch Fabric), and concentrated output buffers for efficient multicasting. The TCSF resolves the cell delay deviation problem which the self-routing crossbar switches inherently have. Further, it offers multiple concurrent pathes from one input to multiple output ports. It also provides multi-channel switching by easy software configuration and has several desirable characteristics such as scalability, high performance, and modularity. A shared traffic concentration and output queuing strategies of the MTCOS results in lower cell loss as well as lower cell delay time over a wide range of multicast traffic. Furthermore, it has lower hardware complexity than that of the SCOQ and Knockout multicast switch to achieve the same Knockout concentration rate as the conventional switches. It is shown that the proposed switch can be easily applied to design high performance for any multicast traffic by analytic analysis and computer simulation.
  • 18.

    A Design and Implementation of Home Network Access Agent and its Testbed

    김동균 | Byoung-Chan Jeon | Lee Sang Jeong and 1other persons | 2006, 11(1) | pp.167~176 | number of Cited : 2
    Abstract PDF
    In this paper, a home network access agent, which controls and monitors networked appliances at home using various terminals regardless of user's location, is designed and implemented. The proposed access agent integrates wire and wireless network on a home gateway (or home server) and is accessed with consistent messages using various terminals such as a web terminal, a PDA and a cellular phone. Also, in order to verify the operation and availability of the agent, a user interface for the various terminals is designed and a home network testbed which is accessed and controlled by the terminals is implemented.
  • 19.

    Anonymity for Low-Power Sensor Node in Ubiquitous Network

    김동명 | Sung-Hee, Woo | Lee, Sang-ho | 2006, 11(1) | pp.177~184 | number of Cited : 0
    Abstract PDF
    The sensors in a ubiquitous network are limited because of the low power and ultra light weight, so many studies have revolved around the sensor. This study improves the process of the registration and authorization and suggests a way to minimize discloser of privacy by using an alias. We introduce RA(Relay Agent) for the restrict function of sensor node, and improve anonymity for private information of each sensor node by assigning alias from SM(Service Manager) in procedure of registration and authentication. The privacy of sensor node is secure in procedure of registration, authentication, and communication between nodes. We could improve the level of security with the only partial increment of computation power of RA and SM without an increase in the amount of sensor nodes.
  • 20.

    Design of Context Awareness Middleware based Hierarchical Context Ontology Management

    Seungkeun Lee | Youngmin Kim | 2006, 11(1) | pp.185~194 | number of Cited : 1
    Abstract PDF
    The ubiquitous computing environment focuses on recognizing the context and physical entities, whereas, previous computing environments mainly focused on the conversational interactions between the computer and the user. For this reason, there has been an increase in the research of context aware computing environments. In previous researches, context services are designed using context ontology used in context aware middleware. So, context service cannot change the context ontology in execution time. We propose a hierarchical context ontology management for context aware service to change their ontology in execution time. And we also a resolution model for context conflict which is occurred in inference of context. We have designed a middleware based on this model and implemented the middleware. As the middleware is implemented on the OSGi framework, it can cause interoperability among devices such as computers, PDAs, home appliances and sensors. It can also support the development and operation of context aware services, which are required in the ubiquitous computing environment.
  • 21.

    A Study on Routing Protocol using C-NODE for Mobile Ad-Hoc Networking

    Choi, Bong Han | 2006, 11(1) | pp.195~202 | number of Cited : 0
    Abstract PDF
    This thesis proposes hybrid routing protocol that mix proactive routing protocol and reactive routing protocol used in Ad hoc network. Proposed method is that establish special node offering network service of nods which construct Ad hoc network and do routing different from existing hybrid routing protocol, ZRP. Special node doing these parts is called C-node. Routing using C-node can accompany efficient routing by decreasing path institution time and flooding time than existing routing protocol.
  • 22.

    An Analysis on the Expected Performance of Constructing and Operating the Integrated Computing Environment in case of Culture Informatization

    HAEYONG JUNG | Sang-Hoon Kim | 2006, 11(1) | pp.203~221 | number of Cited : 2
    Abstract PDF
    This study proposes the methodology of analyzing the expected performance of the Integrated Computing Environment(ICE) on the assumption that the ICE of the agencies and the affiliated organizations under Ministry of Culture and Tourism is constructed and operated. The main objectives of the study are as follows: 1) deriving the performance criteria divided into the operational expected value and the strategic expected value of constructing and operating the ICE for Culture and Tourism informatization, 2) proposing the ways of extracting the detailed criteria for four performance areas(the degree of informatization efficiency, the degree of public service, the innovation and development of IS organization, the culture and tourism value creation) to evaluate the operational expected value based on the BSC(Balanced Scorecard) perspective by using the CSF(Critical Success Factors) methodology, and 3) developing the detailed performance criteria and measures for the economic evaluation of the informatization efficiency from the TCO(Total Cost of Ownership) perspective and suggesting the practical evaluation method by applying them to the case of Culture and Tourism informatization.
  • 23.

    Study on the analysis of model of business process for textile industry of Korea

    Docsung Jang | 2006, 11(1) | pp.223~236 | number of Cited : 3
    Abstract PDF
    Textile industry of Korea has been assumed advanced textile industry nation's aspects with production system and equipment. But has been descended in the sector of design, brand, recognition comparing with Italy, Japan, England. And products of middle and low price do not have competitiveness against China, South East Asia. The world's textile industry nation has been confronted with Free Trade, and Regional Trade Blocks. New market has been opened with Free Trade, but Trade Blocks(NAFTA, EU, APEC etc.) which encourage regional member country's profit maximize made textile export driven nation to consider strategies to cope with. Advanced textile industry nation divided the work among themselves and composed linking system among them which highly valuable products are manufactured at advanced nation and low price products are manufactured by global outsourcing. The purpose of this study is to analyze impact of process which requires to secure international competitiveness into business performance experimentally.
  • 24.

    A Study on the Obstacle Process of the Credit Card Settlement System

    안익수 | Hwang, Lak-hoon | 2006, 11(1) | pp.237~242 | number of Cited : 1
    Abstract PDF
    Currently, the settlement system which is used at credit card settlement from the member store of the off-line credit card is composed of the credit card settlement terminal, the VAN company which does a settlement relay service and the credit card company. When the obstacle occurs from the credit card company, the VAN company which does a settlement relay service conducts an approval vicarious execution, but when the obstacle occurs from the VAN company, the credit card settlement service is not accomplished smoothly. The dissertation implement the credit card settlement system which receives a settlement relay service that credit card settlement terminal uses a Telegram Conversion Agent from the other VAN company when the VAN company obstacle occurs.
  • 25.

    Developing Avatar Converter by using existing Contents in Mobile Contents Development

    DaeHyuck Park | Euisun Kang | Maria Hong and 2other persons | 2006, 11(1) | pp.243~250 | number of Cited : 0
    Abstract PDF
    Mobile device has the same service as PC with the development of mobile technology, such as game, internet, economic service. This paper we play the games in Mobile Device which were popular in Pentium 1 PC, and then develop Avatar Converter by summarizing Automating Elements. In other words, we propose a method that can accelerate developing speed of Mobile Contents by recycling existing resource. The main function of Avatar Converter is that transform existing architecture with dividing logic and resource which can play in mobile by considering restriction items. It can accelerate developing speed by transforming common logic and resource in various contents development for kinds of mobile company.
  • 26.

    Description Method of Mobile Contents based on MPEG-21 Multimedia Framework

    Euisun Kang | DaeHyuck Park | Maria Hong and 1other persons | 2006, 11(1) | pp.251~258 | number of Cited : 2
    Abstract PDF
    When producing a wireless web contents by using wire web contents for PC environment, we should consider how to represent lots of information being suitable with PC environment to wireless devices having narrow performance. Therefore, we propose mobile page editor for manager to select and modify specific contents with the existing wire web page. Also, we try to define an intermediate language based on DID(Digital Item Declaration) of MPEG-21 multimedia framework which defines source of converting information and wireless web contents generating at mobile editor in considering real time service problem when transcoding multimedia information in a web server into wireless device having low resolution, narrow performance of media process, memory, and so on.
  • 27.

    Construction of Integration Management System of Various Speech Corpora

    Rhyu,Kyeong-Taek | Yong-Ju Lee | 정창원 and 1other persons | 2006, 11(1) | pp.259~272 | number of Cited : 0
    Abstract PDF
    In this paper, we propose relevant to design and implementation of an integrated management system for various speech corpora. The purpose of this paper is to manage an integrated management system for various kinds of speech corpora necessary for speech research and speech corpora constructed in different data formats. In addition, ways are considered to allow users to search with effect for speech corpora that meet various conditions which they want, and to allow them to add with ease corpora that are constructed newly. In order to achieve this goal, we design a global schema for an integrated management of new additional information without changing old speech corpora, and construct a web-based integrated management system based on the scheme that can be accessed without any temporal and spatial restrictions. Finally, we describe the web based interface which are the executed results involved in the service and show the efficiency of using the index view for implementation of integrated management system.
  • 28.

    An Index System using Restrictive Distance

    박찬이 | KimSangBok | 2006, 11(1) | pp.273~282 | number of Cited : 1
    Abstract PDF
    In this paper, we propose index method introducing distance concept in word by a method weighting word. This index method is frequent representing an inquiry word and document index and compound noun or more than two adjoin nouns or noun phrase, the farther the distance between these nouns, the fewer selected ratio decreases in index point is the aiming, this choose guide word candidate by existent weight grant method and distance between candidates chose candidate finally in index within 3 sentences. Using in these way I document of 100 kinds of newspaper, scientific treatise, web document and so on, showed the correctness rate resulted of newspaper 92.03% scientific treatise 95% web document 73.33%
  • 29.

    Fingerprint Recognition System for On-line User Authentication

    SangHoon Han | Ho Lee | Seo Jeong-Man | 2006, 11(1) | pp.283~292 | number of Cited : 0
    Abstract PDF
    Interest about a latest security connection technology rises, and try to overcome security vulnerability. Certification about on-line user methods through fingerprint that is biometrics information apply. In this study, designs and implements fingerprint recognition system that is invariant to rotation by fingerprint recognition system for certification about on-line user. Proposed method focused in matching process through pre-process of fingerprint image, feature point extraction. Improved process time and correct recognition rate in fingerprint recognition system that is invariant to rotation presented in existing study. Also, improved noise, distortion problems that happen in preprocess of existing study applying directional Laplacian filter.
  • 30.

    An Implementation of Recommender System using Data Mining Techniques

    Kiwook Lee | 성창규 | 2006, 11(1) | pp.293~300 | number of Cited : 1
    Abstract PDF
    The Recommender systems help users to find and evaluate items of interest. Such systems have become powerful tools in the domains from electronic commerce to digital libraries and knowledge management. Sellers can recommend products to customers with the prediction of future buying behavior on the basis of the consumer's population statistics and past selling behavior. In this paper, we are describing the design and the development of personalization recommender system which increases satisfaction level of customers by searching products to reflect the pattern and propensity of customers properly. The suggested system supplies the real-time analysis service to predict the customers' purchase situation by applying the association rule of the data mining.