Resolving the 'Gray sheep' Problem Using Social Network Analysis (SNA) in Collaborative Filtering (CF) Recommender Systems (소셜 네트워크 분석 기법을 활용한 협업필터링의 특이취향 사용자(Gray Sheep) 문제 해결)
- Kim, Minsung;Im, Il
-
- Journal of Intelligence and Information Systems
- /
- v.20 no.2
- /
- pp.137-148
- /
- 2014
-
Recommender system has become one of the most important technologies in e-commerce in these days. The ultimate reason to shop online, for many consumers, is to reduce the efforts for information search and purchase. Recommender system is a key technology to serve these needs. Many of the past studies about recommender systems have been devoted to developing and improving recommendation algorithms and collaborative filtering (CF) is known to be the most successful one. Despite its success, however, CF has several shortcomings such as cold-start, sparsity, gray sheep problems. In order to be able to generate recommendations, ordinary CF algorithms require evaluations or preference information directly from users. For new users who do not have any evaluations or preference information, therefore, CF cannot come up with recommendations (Cold-star problem). As the numbers of products and customers increase, the scale of the data increases exponentially and most of the data cells are empty. This sparse dataset makes computation for recommendation extremely hard (Sparsity problem). Since CF is based on the assumption that there are groups of users sharing common preferences or tastes, CF becomes inaccurate if there are many users with rare and unique tastes (Gray sheep problem). This study proposes a new algorithm that utilizes Social Network Analysis (SNA) techniques to resolve the gray sheep problem. We utilize 'degree centrality' in SNA to identify users with unique preferences (gray sheep). Degree centrality in SNA refers to the number of direct links to and from a node. In a network of users who are connected through common preferences or tastes, those with unique tastes have fewer links to other users (nodes) and they are isolated from other users. Therefore, gray sheep can be identified by calculating degree centrality of each node. We divide the dataset into two, gray sheep and others, based on the degree centrality of the users. Then, different similarity measures and recommendation methods are applied to these two datasets. More detail algorithm is as follows: Step 1: Convert the initial data which is a two-mode network (user to item) into an one-mode network (user to user). Step 2: Calculate degree centrality of each node and separate those nodes having degree centrality values lower than the pre-set threshold. The threshold value is determined by simulations such that the accuracy of CF for the remaining dataset is maximized. Step 3: Ordinary CF algorithm is applied to the remaining dataset. Step 4: Since the separated dataset consist of users with unique tastes, an ordinary CF algorithm cannot generate recommendations for them. A 'popular item' method is used to generate recommendations for these users. The F measures of the two datasets are weighted by the numbers of nodes and summed to be used as the final performance metric. In order to test performance improvement by this new algorithm, an empirical study was conducted using a publically available dataset - the MovieLens data by GroupLens research team. We used 100,000 evaluations by 943 users on 1,682 movies. The proposed algorithm was compared with an ordinary CF algorithm utilizing 'Best-N-neighbors' and 'Cosine' similarity method. The empirical results show that F measure was improved about 11% on average when the proposed algorithm was used
. Past studies to improve CF performance typically used additional information other than users' evaluations such as demographic data. Some studies applied SNA techniques as a new similarity metric. This study is novel in that it used SNA to separate dataset. This study shows that performance of CF can be improved, without any additional information, when SNA techniques are used as proposed. This study has several theoretical and practical implications. This study empirically shows that the characteristics of dataset can affect the performance of CF recommender systems. This helps researchers understand factors affecting performance of CF. This study also opens a door for future studies in the area of applying SNA to CF to analyze characteristics of dataset. In practice, this study provides guidelines to improve performance of CF recommender systems with a simple modification.
A Study on Establishment of Quality Management System (ISO 9001 : 2000/ KS A9001 : 2001) based on ERP (ERP 기반의 품질경영시스템(ISO 9001 : 2000/ KS A 9001:2001) 구축에 관한 연구)
- 김용직;강창욱
-
- Proceedings of the Society of Korea Industrial and System Engineering Conference
- /
- 2002.05a
- /
- pp.413-419
- /
- 2002
-
본 연구의 목적은 품질경영시스템의 ISO 9000:2000/KS A 9000:2001 개정 규격 내용 및 요구사항을 살펴보는 한편, 우리나라 중소기업이 전환규격을 적용하는데 있어서 ERP PACKAGE를 이용하여 효과적인 품질경영시스템 구축 방안을 제시하기 위함이다. 본 연구에서는 업무 PROCESS와 품질 기록을 중심으로 ISO 9000:2000/KS A 9000:2001 개정 규격을 ERP PACKAGE에 접목하는 방법을 도출하였으며, 적용 사례로서 기계 제조업체의 구매업무를 중심으로 품질경영시스템 구축방안을 제시하였다. 본 연구의 결과는 다음과 같다. 첫째, 정형화된 업무 체계를 갖추어 업무 담당자간 혹은 부서간의 업무 마찰을 줄이고 여러부서에서 발생하는 업부 DATA를 중앙집중식으로 공유하여 동일한 DATA의 수집과 작성에 중복성을 최소화하는 등에서 업무의 효과가 있는 것을 볼 수 있다. 둘째, ERP PACKAGE를 이용한 품질경영시스템(ISO 9000:2000/KS A 9000:2001)의 효과적인 추진 방안은 다음과 같다 1) 전환 규격의 충분한 이해가 요구된다. 2) 현재의 업무 프로세스를 파악한 후 ERP PACKAGE에서 제공하는 개선된 업무프로세스를 적용하는 것이 필요하다. 3) 개선된 업무 프로세스의 실행 결과를 ERP PACKAGE 모듈에서 품질기록으로 유지한다. 4) 새로운 품질경영 정보 시스템을 업무 전반에 적용하기 위한 기업인프라 구축과 프로세스에 대한 지속적인 개선이 요구된다. 본 연구에서는 ISO 9000:2000/KS A 9000:2001 개정 규격요구사항을 이해하고 ERP PACKAGE를 이용하여 최초로 개정규격을 적용하거나, 전환규격으로 품질경영시스템을 구축 시 좀더 효과적이고 효율적인 품질경영시스템을 구축하는데 업무지침으로 활용될 수 있을 것이다.의 수와 생존율면에서 볼 때 가장 적합한 것으로 사료되었다./TEX>개월 투여하게 되면 HDL 콜레스테롤 양이 현저히 증가하였으며, 총 콜레스테롤 양, 동맥경화지표, 중성지방, 유리지방산, 과산화지방은 현 저히 감소하였다.- 결론 - 홍삼과 진세노사이드는 사람과 흰쥐에 있어 과지혈증을 호전시켰다. 실험적으로 과지혈증을 유발시킨 흰쥐에서, 혈중 아포단백질, 지방단백질 및 프로스타글란딘 상호성을 개선시켰다.었다.xA_{2}$ synthetase 억제제인 imidazole의 효과와 유사하였다. 4. G-Re는
$1{\times}10^{-5}g/ml$ 이하의 농도에서는 효과가 없으나$1{\times}10^{-4}g/ml$ 이상의 농도에서 농도의존적으로 유의성 있는$PGE_{2},\;PGF_{2}{\alpha},\;TXB_{2}$ 의 생성억제와 함께 6-keto-$PGF_{1}{\alpha}$ 증가를 보였다. 이는 prostacyclin synthetase를 자극하는 serotonin의 효과와 같은 작용으로서 prostacyclin synthetase 억제제인 tranylcypromine에 대하여 길항효과를 보였다. 5.$TxB_{2}$ 생성억제 작용을 나타내는 ginsenoside들의 효과를 뒷받침하기 위하여 인삼 saponin 성분을 전처치한 patelet rich plasma에서 혈소판 응집시험 결과, ADP로 유도된 혈소판 응집반응에는 모든 인삼 saponin 성분들이 효과가 없었으나 arachidonic acid로 유도된 혈소판 응집반응에는$G-Rb_{2}$ , G-Rc, G-Re의 순으로 농도 의존적인 억제현상을 보였다. 이상의 결과와 같이 인삼 saponin 성분들은
A Method of Recognizing and Validating Road Name Address from Speech-oriented Text (음성 기반 도로명 주소 인식 및 주소 검증 기법)
- Lee, Keonsoo;Kim, Jung-Yeon;Kang, Byeong-Gwon
-
- Journal of Internet Computing and Services
- /
- v.22 no.1
- /
- pp.31-39
- /
- 2021
-
Obtaining delivery addresses from calls is one of the most important processes in TV home shopping business. By automating this process, the operational efficiency of TV home shopping can be increased. In this paper, a method of recognizing and validating road name address, which is the address system of South Korea, from speech oriented text is proposed. The speech oriented text has three challenges. The first is that the numbers are represented in the form of pronunciation. The second is that the recorded address has noises that are made from repeated pronunciation of the same address, or unordered address. The third is that the readability of the resulted address. For resolving these problems, the proposed method enhances the existing address databases provided by the Korea Post and Ministry of the Interior and Safety. Various types of pronouncing address are added, and heuristic rules for dividing ambiguous pronunciations are employed. And the processed address is validated by checking the existence in the official address database. Even though, this proposed method is for the STT result of the address pronunciation, this also can be used for any 3rd party services that need to validate road name address. The proposed method works robustly on noises such as positions change or omission of elements.
A Study on the Measurement Method of Cold Chain Service Quality Using Smart Contract of Blockchain (블록체인의 스마트계약을 이용한 콜드체인 서비스 품질 측정 방안에 대한 연구)
- Kim, ChangHyun;Shin, KwangSup
-
- The Journal of Society for e-Business Studies
- /
- v.24 no.3
- /
- pp.1-18
- /
- 2019
-
Due to the great advances in e-Marketplace and changes in type of items purchased from the online market, it has been dramatically increased the demand of the storage and transportation under the special conditions such as restricted temperature. Especially, the cold chain needs the way to transparently measure and monitor the entire network in realtime because it has a very complicated structure and requires totally different criteria at the every different steps and items. In this research, it has been presented the performance evaluation metrics to make contract using service level agreement (SLA), the way to apply the smart contract based on blockchain, the structure of blocks, service platform and application in order to build cold chain which can prevent the risk factors by measuring and sharing information in realtime using block chain technology. In addition, we have proposed the way to store the measured performance and reputation of each player in the block using smart contract based on SLA. With the presented framework, all players including service providers as well as users can secure the information for making the rational decisions. When the service platform is actually built and operated, it seems possible to secure the information in transparently and realtime. Also, it is possible to prevent the risk factors or prepare the preemptive plans to react on them.
User-Perspective Issue Clustering Using Multi-Layered Two-Mode Network Analysis (다계층 이원 네트워크를 활용한 사용자 관점의 이슈 클러스터링)
- Kim, Jieun;Kim, Namgyu;Cho, Yoonho
-
- Journal of Intelligence and Information Systems
- /
- v.20 no.2
- /
- pp.93-107
- /
- 2014
-
In this paper, we report what we have observed with regard to user-perspective issue clustering based on multi-layered two-mode network analysis. This work is significant in the context of data collection by companies about customer needs. Most companies have failed to uncover such needs for products or services properly in terms of demographic data such as age, income levels, and purchase history. Because of excessive reliance on limited internal data, most recommendation systems do not provide decision makers with appropriate business information for current business circumstances. However, part of the problem is the increasing regulation of personal data gathering and privacy. This makes demographic or transaction data collection more difficult, and is a significant hurdle for traditional recommendation approaches because these systems demand a great deal of personal data or transaction logs. Our motivation for presenting this paper to academia is our strong belief, and evidence, that most customers' requirements for products can be effectively and efficiently analyzed from unstructured textual data such as Internet news text. In order to derive users' requirements from textual data obtained online, the proposed approach in this paper attempts to construct double two-mode networks, such as a user-news network and news-issue network, and to integrate these into one quasi-network as the input for issue clustering. One of the contributions of this research is the development of a methodology utilizing enormous amounts of unstructured textual data for user-oriented issue clustering by leveraging existing text mining and social network analysis. In order to build multi-layered two-mode networks of news logs, we need some tools such as text mining and topic analysis. We used not only SAS Enterprise Miner 12.1, which provides a text miner module and cluster module for textual data analysis, but also NetMiner 4 for network visualization and analysis. Our approach for user-perspective issue clustering is composed of six main phases: crawling, topic analysis, access pattern analysis, network merging, network conversion, and clustering. In the first phase, we collect visit logs for news sites by crawler. After gathering unstructured news article data, the topic analysis phase extracts issues from each news article in order to build an article-news network. For simplicity, 100 topics are extracted from 13,652 articles. In the third phase, a user-article network is constructed with access patterns derived from web transaction logs. The double two-mode networks are then merged into a quasi-network of user-issue. Finally, in the user-oriented issue-clustering phase, we classify issues through structural equivalence, and compare these with the clustering results from statistical tools and network analysis. An experiment with a large dataset was performed to build a multi-layer two-mode network. After that, we compared the results of issue clustering from SAS with that of network analysis. The experimental dataset was from a web site ranking site, and the biggest portal site in Korea. The sample dataset contains 150 million transaction logs and 13,652 news articles of 5,000 panels over one year. User-article and article-issue networks are constructed and merged into a user-issue quasi-network using Netminer. Our issue-clustering results applied the Partitioning Around Medoids (PAM) algorithm and Multidimensional Scaling (MDS), and are consistent with the results from SAS clustering. In spite of extensive efforts to provide user information with recommendation systems, most projects are successful only when companies have sufficient data about users and transactions. Our proposed methodology, user-perspective issue clustering, can provide practical support to decision-making in companies because it enhances user-related data from unstructured textual data. To overcome the problem of insufficient data from traditional approaches, our methodology infers customers' real interests by utilizing web transaction logs. In addition, we suggest topic analysis and issue clustering as a practical means of issue identification.
The Effects of the Attributes of the Eco-friendly Agricultural Products Traceability System on Perceived Value and Behavioral Intention (친환경농산물 이력추적시스템의 속성이 소비자의 지각된 가치 및 행동의도에 미치는 영향)
- Choi, Won-Sik;Choi, Soo-Kun;Lee, Soo-Bum
-
- Culinary science and hospitality research
- /
- v.19 no.4
- /
- pp.161-175
- /
- 2013
-
This study investigates the impact of the attributes of the eco-friendly agricultural products traceability system on perceived value and behavioral intention. Empirical subjects are those who live in Seoul and Gyeonggi province, over the age of 20 and have experience of buying eco-friendly agricultural products though department stores, discount stores and specialized eco-friendly product stores. After distributing 550 copies of questionnaire from April 10th, 2013 to May 9th, 2013, 470 copies(85.5%) are used for a final statistical analysis of the survey after excluding the copies with biased opinions or missing values. The results of this study show sufficient theoretical base for future research by verifying a causal relationships between the attributes of eco-friendly agricultural products traceability system such as reliability, safety and innovation, and consumers' perceived value and behavioral intention. Therefore, producers should correctly record producing history base so that consumers can continue to use the system. The traceability system can not only satisfy consumers by enhancing transparent management and producing systems for eco-friendly products but also guarantee us to eat all products we get without worries.
Consumer Heterogeneity and Price Promotion Effectiveness in Subscription-based Online Platforms (소비자 특성에 따른 가격 촉진 효과에 대한 실증 연구: 플랫폼 구독 경제를 중심으로)
- Changkeun Kim;Byungjoon Yoo;Jaehwan Lee
-
- Information Systems Review
- /
- v.22 no.3
- /
- pp.143-156
- /
- 2020
-
Price promotion is one of the most frequently marketing strategies with a long history. According to various studies, the effect of price promotion is controversial. Some studies have argued that price promotion has a positive effect, while others have found that it has no effect or rather has a negative effect. This study aims to examine the effect of price promotion in a subscription-based service. First, we check the effect of price promotion on the repurchase of the consumer. And we investigate how this effect varies depending on the characteristics of the consumer. Using the data from one of the music streaming service in South Korea, the effect of consumers' price promotion experience, demographic characteristics, and behavioral characteristics on their repurchase is analyzed through logistic regression analysis. As a result of the study, it is found that consumers' experience of price promotion has a positive effect on repurchase. In addition, the positive effect of price promotion is relatively greater in younger and female consumers. This study has implications in that it not only confirmed the positive effect of price promotion in a subscription-based environment but also empirically confirmed that the characteristics of consumers should be considered when performing price promotion.
A Methodology for Extracting Shopping-Related Keywords by Analyzing Internet Navigation Patterns (인터넷 검색기록 분석을 통한 쇼핑의도 포함 키워드 자동 추출 기법)
- Kim, Mingyu;Kim, Namgyu;Jung, Inhwan
-
- Journal of Intelligence and Information Systems
- /
- v.20 no.2
- /
- pp.123-136
- /
- 2014
-
Recently, online shopping has further developed as the use of the Internet and a variety of smart mobile devices becomes more prevalent. The increase in the scale of such shopping has led to the creation of many Internet shopping malls. Consequently, there is a tendency for increasingly fierce competition among online retailers, and as a result, many Internet shopping malls are making significant attempts to attract online users to their sites. One such attempt is keyword marketing, whereby a retail site pays a fee to expose its link to potential customers when they insert a specific keyword on an Internet portal site. The price related to each keyword is generally estimated by the keyword's frequency of appearance. However, it is widely accepted that the price of keywords cannot be based solely on their frequency because many keywords may appear frequently but have little relationship to shopping. This implies that it is unreasonable for an online shopping mall to spend a great deal on some keywords simply because people frequently use them. Therefore, from the perspective of shopping malls, a specialized process is required to extract meaningful keywords. Further, the demand for automating this extraction process is increasing because of the drive to improve online sales performance. In this study, we propose a methodology that can automatically extract only shopping-related keywords from the entire set of search keywords used on portal sites. We define a shopping-related keyword as a keyword that is used directly before shopping behaviors. In other words, only search keywords that direct the search results page to shopping-related pages are extracted from among the entire set of search keywords. A comparison is then made between the extracted keywords' rankings and the rankings of the entire set of search keywords. Two types of data are used in our study's experiment: web browsing history from July 1, 2012 to June 30, 2013, and site information. The experimental dataset was from a web site ranking site, and the biggest portal site in Korea. The original sample dataset contains 150 million transaction logs. First, portal sites are selected, and search keywords in those sites are extracted. Search keywords can be easily extracted by simple parsing. The extracted keywords are ranked according to their frequency. The experiment uses approximately 3.9 million search results from Korea's largest search portal site. As a result, a total of 344,822 search keywords were extracted. Next, by using web browsing history and site information, the shopping-related keywords were taken from the entire set of search keywords. As a result, we obtained 4,709 shopping-related keywords. For performance evaluation, we compared the hit ratios of all the search keywords with the shopping-related keywords. To achieve this, we extracted 80,298 search keywords from several Internet shopping malls and then chose the top 1,000 keywords as a set of true shopping keywords. We measured precision, recall, and F-scores of the entire amount of keywords and the shopping-related keywords. The F-Score was formulated by calculating the harmonic mean of precision and recall. The precision, recall, and F-score of shopping-related keywords derived by the proposed methodology were revealed to be higher than those of the entire number of keywords. This study proposes a scheme that is able to obtain shopping-related keywords in a relatively simple manner. We could easily extract shopping-related keywords simply by examining transactions whose next visit is a shopping mall. The resultant shopping-related keyword set is expected to be a useful asset for many shopping malls that participate in keyword marketing. Moreover, the proposed methodology can be easily applied to the construction of special area-related keywords as well as shopping-related ones.
A Design on the Multimedia Fingerprinting code based on Feature Point for Forensic Marking (포렌식 마킹을 위한 특징점 기반의 동적 멀티미디어 핑거프린팅 코드 설계)
- Rhee, Kang-Hyeon
-
- Journal of the Institute of Electronics Engineers of Korea CI
- /
- v.48 no.4
- /
- pp.27-34
- /
- 2011
-
In this paper, it was presented a design on the dynamic multimedia fingerprinting code for anti-collusion code(ACC) in the protection of multimedia content. Multimedia fingerprinting code for the conventional ACC, is designed with a mathematical method to increase k to k+1 by transform from BIBD's an incidence matrix to a complement matrix. A codevector of the complement matrix is allowanced fingerprinting code to a user' authority and embedded into a content. In the proposed algorithm, the feature points were drawing from a content which user bought, with based on these to design the dynamical multimedia fingerprinting code. The candidate codes of ACC which satisfied BIBD's v and k+1 condition is registered in the codebook, and then a matrix is generated(Below that it calls "Rhee matrix") with
${\lambda}+1$ condition. In the experimental results, the codevector of Rhee matrix based on a feature point of the content is generated to exist k in the confidence interval at the significance level ($1-{\alpha}$ ). Euclidean distances between row and row and column and column each other of Rhee matrix is working out same k value as like the compliment matrices based on BIBD and Graph. Moreover, first row and column of Rhee matrix are an initial firing vector and to be a forensic mark of content protection. Because of the connection of the rest codevectors is reported in the codebook, when trace a colluded code, it isn't necessity to solve a correlation coefficient between original fingerprinting code and the colluded code but only search the codebook then a trace of the colluder is easy. Thus, the generated Rhee matrix in this paper has an excellent robustness and fidelity more than the mathematically generated matrix based on BIBD as ACC.
A Theoretical Review on the Untact Marketing of the COVID-19 Period Hospitality Industry Services (코로나 시대 환대산업 서비스의 언택트 마케팅에 관한 고찰)
- Kang, Hee-Seog;Lee, Youn-Oak
-
- Journal of Korea Entertainment Industry Association
- /
- v.14 no.7
- /
- pp.161-173
- /
- 2020
-
In-depth interview in the field of hospitality industry services was conducted in COVID- 19. Introduction of kiosks for non-face-to-face services using untact technology, reservation, pay systems, self-service, service improvement using room service should be carried out. It is also necessary to implement Instagram, Facebook, YouTube, P-blogs, online broadcasting and live commerce through the establishment of m-channel system through untact marketing sales channels in the hospitality industry now that the product composition to solve the pro -blem of untact marketing is drawing attention due to diversification of online sales channe -ls. Now, the recognition of important elements of service education and a establishment of differentiated system of untact marketing, expansion of untact sale channel, implementation of non-face-to-face counseling service and introduction of pre-booking, telecommuting were recognized as urgent parts. In particular, a service differentiation and importance of human services, which were recognized free of charge, have re-recognized as premium, and quality service aspect of the hospitality industry in untact and the direction to diversify marketing channels are presented.
이메일무단수집거부
- 본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나 그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며, 이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
- [게시일 2004년 10월 1일]
이용약관
-
제 1 장 총칙
- 제 1 조 (목적) 이 이용약관은 KoreaScience 홈페이지(이하 “당 사이트”)에서 제공하는 인터넷 서비스(이하 '서비스')의 가입조건 및 이용에 관한 제반 사항과 기타 필요한 사항을 구체적으로 규정함을 목적으로 합니다.
- 제 2 조 (용어의 정의) ① "이용자"라 함은 당 사이트에 접속하여 이 약관에 따라 당 사이트가 제공하는 서비스를 받는 회원 및 비회원을 말합니다. ② "회원"이라 함은 서비스를 이용하기 위하여 당 사이트에 개인정보를 제공하여 아이디(ID)와 비밀번호를 부여 받은 자를 말합니다. ③ "회원 아이디(ID)"라 함은 회원의 식별 및 서비스 이용을 위하여 자신이 선정한 문자 및 숫자의 조합을 말합니다. ④ "비밀번호(패스워드)"라 함은 회원이 자신의 비밀보호를 위하여 선정한 문자 및 숫자의 조합을 말합니다.
- 제 3 조 (이용약관의 효력 및 변경) ① 이 약관은 당 사이트에 게시하거나 기타의 방법으로 회원에게 공지함으로써 효력이 발생합니다. ② 당 사이트는 이 약관을 개정할 경우에 적용일자 및 개정사유를 명시하여 현행 약관과 함께 당 사이트의 초기화면에 그 적용일자 7일 이전부터 적용일자 전일까지 공지합니다. 다만, 회원에게 불리하게 약관내용을 변경하는 경우에는 최소한 30일 이상의 사전 유예기간을 두고 공지합니다. 이 경우 당 사이트는 개정 전 내용과 개정 후 내용을 명확하게 비교하여 이용자가 알기 쉽도록 표시합니다.
- 제 4 조(약관 외 준칙) ① 이 약관은 당 사이트가 제공하는 서비스에 관한 이용안내와 함께 적용됩니다. ② 이 약관에 명시되지 아니한 사항은 관계법령의 규정이 적용됩니다.
-
제 2 장 이용계약의 체결
- 제 5 조 (이용계약의 성립 등) ① 이용계약은 이용고객이 당 사이트가 정한 약관에 「동의합니다」를 선택하고, 당 사이트가 정한 온라인신청양식을 작성하여 서비스 이용을 신청한 후, 당 사이트가 이를 승낙함으로써 성립합니다. ② 제1항의 승낙은 당 사이트가 제공하는 과학기술정보검색, 맞춤정보, 서지정보 등 다른 서비스의 이용승낙을 포함합니다.
- 제 6 조 (회원가입) 서비스를 이용하고자 하는 고객은 당 사이트에서 정한 회원가입양식에 개인정보를 기재하여 가입을 하여야 합니다.
- 제 7 조 (개인정보의 보호 및 사용) 당 사이트는 관계법령이 정하는 바에 따라 회원 등록정보를 포함한 회원의 개인정보를 보호하기 위해 노력합니다. 회원 개인정보의 보호 및 사용에 대해서는 관련법령 및 당 사이트의 개인정보 보호정책이 적용됩니다.
- 제 8 조 (이용 신청의 승낙과 제한) ① 당 사이트는 제6조의 규정에 의한 이용신청고객에 대하여 서비스 이용을 승낙합니다. ② 당 사이트는 아래사항에 해당하는 경우에 대해서 승낙하지 아니 합니다. - 이용계약 신청서의 내용을 허위로 기재한 경우 - 기타 규정한 제반사항을 위반하며 신청하는 경우
- 제 9 조 (회원 ID 부여 및 변경 등) ① 당 사이트는 이용고객에 대하여 약관에 정하는 바에 따라 자신이 선정한 회원 ID를 부여합니다. ② 회원 ID는 원칙적으로 변경이 불가하며 부득이한 사유로 인하여 변경 하고자 하는 경우에는 해당 ID를 해지하고 재가입해야 합니다. ③ 기타 회원 개인정보 관리 및 변경 등에 관한 사항은 서비스별 안내에 정하는 바에 의합니다.
-
제 3 장 계약 당사자의 의무
- 제 10 조 (KISTI의 의무) ① 당 사이트는 이용고객이 희망한 서비스 제공 개시일에 특별한 사정이 없는 한 서비스를 이용할 수 있도록 하여야 합니다. ② 당 사이트는 개인정보 보호를 위해 보안시스템을 구축하며 개인정보 보호정책을 공시하고 준수합니다. ③ 당 사이트는 회원으로부터 제기되는 의견이나 불만이 정당하다고 객관적으로 인정될 경우에는 적절한 절차를 거쳐 즉시 처리하여야 합니다. 다만, 즉시 처리가 곤란한 경우는 회원에게 그 사유와 처리일정을 통보하여야 합니다.
- 제 11 조 (회원의 의무) ① 이용자는 회원가입 신청 또는 회원정보 변경 시 실명으로 모든 사항을 사실에 근거하여 작성하여야 하며, 허위 또는 타인의 정보를 등록할 경우 일체의 권리를 주장할 수 없습니다. ② 당 사이트가 관계법령 및 개인정보 보호정책에 의거하여 그 책임을 지는 경우를 제외하고 회원에게 부여된 ID의 비밀번호 관리소홀, 부정사용에 의하여 발생하는 모든 결과에 대한 책임은 회원에게 있습니다. ③ 회원은 당 사이트 및 제 3자의 지적 재산권을 침해해서는 안 됩니다.
-
제 4 장 서비스의 이용
- 제 12 조 (서비스 이용 시간) ① 서비스 이용은 당 사이트의 업무상 또는 기술상 특별한 지장이 없는 한 연중무휴, 1일 24시간 운영을 원칙으로 합니다. 단, 당 사이트는 시스템 정기점검, 증설 및 교체를 위해 당 사이트가 정한 날이나 시간에 서비스를 일시 중단할 수 있으며, 예정되어 있는 작업으로 인한 서비스 일시중단은 당 사이트 홈페이지를 통해 사전에 공지합니다. ② 당 사이트는 서비스를 특정범위로 분할하여 각 범위별로 이용가능시간을 별도로 지정할 수 있습니다. 다만 이 경우 그 내용을 공지합니다.
- 제 13 조 (홈페이지 저작권) ① NDSL에서 제공하는 모든 저작물의 저작권은 원저작자에게 있으며, KISTI는 복제/배포/전송권을 확보하고 있습니다. ② NDSL에서 제공하는 콘텐츠를 상업적 및 기타 영리목적으로 복제/배포/전송할 경우 사전에 KISTI의 허락을 받아야 합니다. ③ NDSL에서 제공하는 콘텐츠를 보도, 비평, 교육, 연구 등을 위하여 정당한 범위 안에서 공정한 관행에 합치되게 인용할 수 있습니다. ④ NDSL에서 제공하는 콘텐츠를 무단 복제, 전송, 배포 기타 저작권법에 위반되는 방법으로 이용할 경우 저작권법 제136조에 따라 5년 이하의 징역 또는 5천만 원 이하의 벌금에 처해질 수 있습니다.
- 제 14 조 (유료서비스) ① 당 사이트 및 협력기관이 정한 유료서비스(원문복사 등)는 별도로 정해진 바에 따르며, 변경사항은 시행 전에 당 사이트 홈페이지를 통하여 회원에게 공지합니다. ② 유료서비스를 이용하려는 회원은 정해진 요금체계에 따라 요금을 납부해야 합니다.
-
제 5 장 계약 해지 및 이용 제한
- 제 15 조 (계약 해지) 회원이 이용계약을 해지하고자 하는 때에는 [가입해지] 메뉴를 이용해 직접 해지해야 합니다.
- 제 16 조 (서비스 이용제한) ① 당 사이트는 회원이 서비스 이용내용에 있어서 본 약관 제 11조 내용을 위반하거나, 다음 각 호에 해당하는 경우 서비스 이용을 제한할 수 있습니다. - 2년 이상 서비스를 이용한 적이 없는 경우 - 기타 정상적인 서비스 운영에 방해가 될 경우 ② 상기 이용제한 규정에 따라 서비스를 이용하는 회원에게 서비스 이용에 대하여 별도 공지 없이 서비스 이용의 일시정지, 이용계약 해지 할 수 있습니다.
- 제 17 조 (전자우편주소 수집 금지) 회원은 전자우편주소 추출기 등을 이용하여 전자우편주소를 수집 또는 제3자에게 제공할 수 없습니다.
-
제 6 장 손해배상 및 기타사항
- 제 18 조 (손해배상) 당 사이트는 무료로 제공되는 서비스와 관련하여 회원에게 어떠한 손해가 발생하더라도 당 사이트가 고의 또는 과실로 인한 손해발생을 제외하고는 이에 대하여 책임을 부담하지 아니합니다.
- 제 19 조 (관할 법원) 서비스 이용으로 발생한 분쟁에 대해 소송이 제기되는 경우 민사 소송법상의 관할 법원에 제기합니다.
- [부 칙] 1. (시행일) 이 약관은 2016년 9월 5일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.
Detail Search
Image Search (β)