• Title/Summary/Keyword: 논문 랭킹

Search Result 161, Processing Time 0.03 seconds

A Ranking method using link & description information in Meta searching (메타검색에서 링크정보와 요약정보를 이용한 검색결과 통합)

  • 양명석;이석형;강남규;윤화묵
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10c
    • /
    • pp.118-120
    • /
    • 2002
  • 본 논문은 메타검색엔진 시스템에서 다양한 검색결과를 하나의 검색결과로 통합시켜주는 통합랭킹 방법에 대한 연구이다 검색결과 통합시 메타검색 시스템에서 실질적으로 이용할 수 있는 링크정보와 요약정보를 사용하였다 통해 이루어져 있다. 또한 링크정보와 요약정보에 대한 가중치 값을 변화시키면서 다양한 검색결과들을 얻을 수 있었는데, 요약정보의 가중치를 높여 주었을 때 검색 효율이 좋음을 알 수 있었다.

  • PDF

Modeling a Multi-Agent based Web Mining System on the Hierarchical Web Environment (계층적 웹 환경에서의 멀티-에이전트 기반 웹 마이닝 시스템 설계)

  • Yoon, Hee-Byung;Kim, Hwa-Soo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.13 no.6
    • /
    • pp.643-648
    • /
    • 2003
  • In order to provide efficient retrieving results for user query on the web environment, the various searching algorithms have developed and considered user's preference and convenience. However, the searching algorithms are developed on the horizontal and non hierarchical web environment in general and could not apply to the complex hierarchical and functional web environments such like the enterprise network. In this paper, we purpose the multi-agent based web mining system which can provide the efficient mining results to the user on the special web environment. For doing this, we suggest the network model with the hierarchical web environment and model the multi agent based web mining system which has four corporation agents and fourteen process modules. Then, we explain the detailed functions of each agent considered the hierarchical environment according to the module. Especially, we purpose the new merging agent and improved ranking algorithm by using the graph theory.

Document Summarization Using Mutual Recommendation with LSA and Sense Analysis (LSA를 이용한 문장 상호 추천과 문장 성향 분석을 통한 문서 요약)

  • Lee, Dong-Wook;Baek, Seo-Hyeon;Park, Min-Ji;Park, Jin-Hee;Jung, Hye-Wuk;Lee, Jee-Hyong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.22 no.5
    • /
    • pp.656-662
    • /
    • 2012
  • In this paper, we describe a new summarizing method based on a graph-based and a sense-based analysis. In the graph-based analysis, we convert sentences in a document into word vectors and calculate the similarity between each sentence using LSA. We reflect this similarity of sentences and the rarity scores of words in sentences to define weights of edges in the graph. Meanwhile, in the sense-based analysis, in order to determine the sense of words, subjectivity or objectivity, we built a database which is extended from the golden standards using Wordnet. We calculate the subjectivity of sentences from the sense of words, and select more subjective sentences. Lastly, we combine the results of these two methods. We evaluate the performance of the proposed method using classification games, which are usually used to measure the performances of summarization methods. We compare our method with the MS-Word auto-summarization, and verify the effectiveness of ours.

Generating Pairwise Comparison Set for Crowed Sourcing based Deep Learning (크라우드 소싱 기반 딥러닝 선호 학습을 위한 쌍체 비교 셋 생성)

  • Yoo, Kihyun;Lee, Donggi;Lee, Chang Woo;Nam, Kwang Woo
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.27 no.5
    • /
    • pp.1-11
    • /
    • 2022
  • With the development of deep learning technology, various research and development are underway to estimate preference rankings through learning, and it is used in various fields such as web search, gene classification, recommendation system, and image search. Approximation algorithms are used to estimate deep learning-based preference ranking, which builds more than k comparison sets on all comparison targets to ensure proper accuracy, and how to build comparison sets affects learning. In this paper, we propose a k-disjoint comparison set generation algorithm and a k-chain comparison set generation algorithm, a novel algorithm for generating paired comparison sets for crowd-sourcing-based deep learning affinity measurements. In particular, the experiment confirmed that the k-chaining algorithm, like the conventional circular generation algorithm, also has a random nature that can support stable preference evaluation while ensuring connectivity between data.

A Study on the Walkability Scores in Jeonju City Using Multiple Regression Models (다중 회귀 모델을 이용한 전주시 보행 환경 점수 예측에 관한 연구)

  • Lee, KiChun;Nam, KwangWoo;Lee, ChangWoo
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.27 no.4
    • /
    • pp.1-10
    • /
    • 2022
  • Attempts to interpret human perspectives using computer vision have been developed in various fields. In this paper, we propose a method for evaluating the walking environment through semantic segmentation results of images from road images. First, the Kakao Map API was used to collect road images, and four-way images were collected from about 50,000 points in JeonJu. 20% of the collected images build datasets through crowdsourcing-based paired comparisons, and train various regression models using paired comparison data. In order to derive the walkability score of the image data, the ranking score is calculated using the Trueskill algorithm, which is a ranking algorithm, and the walkability and analysis using various regression models are performed using the constructed data. Through this study, it is shown that the walkability of Jeonju can be evaluated and scores can be derived through the correlation between pixel distribution classification information rather than human vision.

Recommendation Model for Battlefield Analysis based on Siamese Network

  • Geewon, Suh;Yukyung, Shin;Soyeon, Jin;Woosin, Lee;Jongchul, Ahn;Changho, Suh
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.1
    • /
    • pp.1-8
    • /
    • 2023
  • In this paper, we propose a training method of a recommendation learning model that analyzes the battlefield situation and recommends a suitable hypothesis for the current situation. The proposed learning model uses the preference determined by comparing the two hypotheses as a label data to learn which hypothesis best analyzes the current battlefield situation. Our model is based on Siamese neural network architecture which uses the same weights on two different input vectors. The model takes two hypotheses as an input, and learns the priority between two hypotheses while sharing the same weights in the twin network. In addition, a score is given to each hypothesis through the proposed post-processing ranking algorithm, and hypotheses with a high score can be recommended to the commander in charge.

A Study on the Semantic Match Making for Intelligent Web Service (지능형 웹 서비스를 위한 시맨틱 매치 메이킹에 관한 연구)

  • 김지영;양진혁;공유근;정인정
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10a
    • /
    • pp.34-36
    • /
    • 2003
  • 지능형 웹 서비스를 효과적으로 구현하기 위해서는 다양한 사용자들이 필요로 하는 데이터를 만족스럽게 제공할 수 있는 매치 메이킹의 구현이 중요한 과제이다. 이를 위한 관련 연구로 필터링 메커니즘을 제안하고 있는 LARKS, 브로커에이전트를 이용한 InfoSlueth, RDF 그래프 매칭 연구 및 DL 기반의 매칭 방법 등이 있다. 그러나 기존 연구들은 등급 개념을 가지는 유연한 검색 결과를 제공하지 못한다는 큰 문제점을 가진다. 본 논문에서는 기존 방법들을 개선하기 위한 노력으로서. 서비스 매치 메이킹의 결과들에 등급(랭킹)을 부터 하는 시맨틱 매치 메이커를 제안한다. 본 논문에서 제안하는 시맨틱 매치 메이커는 서비스 제공자와 서비스 요청자 사이의 유연한 매칭을 제공하여 지능형 웹 서비스를 효과적으로 수행 할 수 있게 한다. 본 논문에서 제안한 방법론은 서비스 광고 및 요청을 표현하기 위한 언어로 DAML-S를 채택하였고. DAML-S의 서비스 프로파일 뿐만 아니라 프로세스 모델 온톨로지 모두를 고려하는 새로운 접근법이다.

  • PDF

Service Provider Ranking Based on Visual Media Ontology (시각 미디어 온톨로지에 기반한 서비스 제공자 랭킹)

  • Min, Young-Kun;Lee, Bog-Ju
    • The KIPS Transactions:PartB
    • /
    • v.15B no.4
    • /
    • pp.315-322
    • /
    • 2008
  • It is important to retrieve effectively the visual media such as pictures and video in the internet, especially to the application areas such as electronic art museum, e-commerce, and internet shopping malls. It is also needed in these areas to have content-based or even semantic-based multimedia retrieval instead of simple keyword-based retrieval. In our earlier research, we proposed a semantic-based visual media retrieval framework for the effective retrieval of the visual media from the internet. It uses visual media metadata and ontology based on the web service to achieve the semantic-based retrieval. In this research, there are more than one visual media service providers and one central service broker. As a preliminary step to the visual media data retrieval, a method is proposed to retrieve the service providers effectively. The method uses the structure of the ontology tree to obtain the providers and their rankings. It also uses the size of sub nodes and child nodes in the tree. It measures the rankings of providers more effectively than previous method. The experimental results show the accuracy of the method while keeping compatible speed against the existing method.

A Study on the Effect of V-Ring Pressure and Clearance on the Die Roll Height Through the Fine Blanking (파인블랭킹 공정에서 V-링 압력과 클리어런스가 다이 롤 높이에 미치는 영향에 관한 연구)

  • Lee, Chun-Kyu;Kim, Jong-Deok;Kim, Young-Choon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.12
    • /
    • pp.6060-6065
    • /
    • 2013
  • Minimizing the height of the die roll is very important for maximizing the size of effective shear planes. In this study, the die roll change was investigated for the change in the amounts and clearance of the V-ring indentation. Shear analysis and experiments were conducted with the V-ring distance fixed to 2mm. Fine blanking die was applied to the die insert with different clearances. Several specimens were analyzed about the height of the die roll. As a result, the pressure of V-ring effectively inhibited the flow of materials. And the height of the die roll was lowest when the clearance between the die and punch was 1% of the material thickness.

Analysis of HTML Structure in E-commerce Websites Using Tree Representation (트리 표현을 사용하는 전자상거래 웹 사이트의 HTML 구조 분석)

  • Ventura, Jose E.;Park, Jeong-Sun
    • Journal of the Korea Safety Management & Science
    • /
    • v.13 no.4
    • /
    • pp.201-205
    • /
    • 2011
  • 개인화된 제품과 서비스에 대한 소비자의 요구는 성공적인 전자상거래 플랫폼을 기반으로 하고 있다. 성공적인 전자상거래 플랫폼을 개발함에 있어 자주 간과되고 있는 중요한 요소는 바로 웹 페이지의 HTML 구조이다. HTML 구조는 전자상거래 웹사이트의 속도와 랭킹을 결정짓는 기본적인 요소이다. 본 논문은 HTML 구조를 분석하기 위한 효율적이고 다소 생소한 시각화 기법을 제안하는데, 이러한 기법을 사용하여 개발자는 잠재적인 프로그래밍 오류와 개선 사항을 발견할 수 있다. 본 논문은 하나의 사례를 이용하여 제안된 기법을 더욱 구체화 시킨다.