• 제목/요약/키워드: 클릭

Search Result 486, Processing Time 0.03 seconds

A Study on the Click Recognition Improvement of a Wearable Input Device (착용형 입력장치에서의 클릭 인식성능 향상방법에 관한 연구)

  • Soh, Byung-Seok;Kim, Yoon-Sang;Lee, Sang-Goog
    • Proceedings of the KIEE Conference
    • /
    • 2004.07d
    • /
    • pp.2553-2555
    • /
    • 2004
  • 본 논문은 사용자의 손가락 및 손의 움직임을 이용하여 키보드와 마우스로 사용하도록 개발된 착용형 입력장치 ($SCURRY^{TM}$)의 손가락 움직임을 감지하는 클릭인식 성능의 향상 방법을 제안한다. 제작된 착용형 입력장치는 클릭 감지용 가속도계가 장착된 손가락 부분과 손 움직임 감지용 각속도계가 장착된 손등 부분, 그리고 화면상의 가상키보드의 구성된다. 제안하는 클릭 감지 방법은 사용자의 클릭 의도를 파악하는 특징 추출부, 클릭 동작을 수행한 손가락을 판별하는 유효클릭 인식부, 그리고 손 움직임에 의해 발생된 외도하지 않은 클릭신호를 제거하는 신호혼선 제거부로 구성된다. 제안된 방법을 이용하여 착용형 입력장치의 클릭 일시성능이 향상됨을 실험으로부터 확인하였다.

  • PDF

A Study on Link-Click Iteration Model (링크-클릭 순환모형에 관한 고찰)

  • Rho Young-J.
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.06b
    • /
    • pp.43-45
    • /
    • 2006
  • 본 논문에서는 사용자 인터페이스에서 발생하는 링크와 클릭의 순환과정에 대하여 고찰하였다. 링크는 저자 관점에서의 클릭이고, 클릭은 독자/사용자 관점에서의 링크로 해석할 수 있다. 링크에 대한 클릭으로 읽기 구조가 만들어지며, 이 과정에서 읽기의 문맥이 영향을 받는다. 이러한 변화는 사용자의 예측에 영향을 미치게 되고, 그 결과로 사용자의 다음 행위에 영향을 미친다. 이러한 순환의 과정을 사용자 관점에서 모형화 하였다. 링크-클릭 순환모형은 화면에서의 문맥변화에 따라 6단계로 구성된다. 이 모형의 효과성을 보기 위하여 인터넷 탐색기 상에서 두 개의 유명 포탈 홈페이지를 고찰해 보았다.

  • PDF

Analysis and Evaluation of Most Clicked Documents of Korean Search Portal (검색 포털의 클릭 집중 문서 분석 평가)

  • Park, So-Yeon
    • Journal of Korean Library and Information Science Society
    • /
    • v.42 no.1
    • /
    • pp.325-338
    • /
    • 2011
  • This study aims to investigate characteristics of most clicked documents of Naver's universal search service. In particular, this study analyzed characteristics of most clicked documents such as click ratio, collection distribution, and yearly distribution. Also, clicked documents were evaluated in terms of relevance, credibility, and currency. In conducting this study, query logs and click logs of unified search service were analyzed. The results of this study show that most clicks occurred in blog collection and average click concentration rate reached almost 50%. Also, the relevance and currency of most clicked documents were quite high, but credibility of these documents were on average level. The results of this study can be implemented to the portal's effective development of searching algorithm and interface.

Fraud Click Identification Using Fingerprinting Method (핑거프린팅 기법을 이용한 부정 클릭의 식별)

  • Hong, Young-Ran;Kim, Dong-Soo
    • The Journal of Society for e-Business Studies
    • /
    • v.16 no.3
    • /
    • pp.159-168
    • /
    • 2011
  • To identify fraud clicks in the Internet advertisement, existing studies have considered keyword, visit time, and client IP as an independent variable for the standard. These methods have limitations in identifying the fraud clicks that utilize automation tools, for they are methods based on client IP and human activities on the Internet. This paper proposes that fingerprinting values of the variable combination should be used to identify fraud clicks. The proposed model is composed of 3 stages and the fingerprinting values are compared with the other input data at each stage; IP fingerprinting in the first stage, IP and session data fingerprinting in the second stage, and session data and keyword fingerprinting in the third stage. We showed that the proposed model of the fraud click identification is more correct than existing methods through experiments according to the proposed scheme.

Maximum Degree Vertex-Based Algorithm for Maximum Clique Problem (최대 클릭 문제에 관한 최대차수 정점 기반 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.1
    • /
    • pp.227-235
    • /
    • 2015
  • In this paper, I propose a linear time algorithm devised to produce exact solution to NP-complete maximum clique problem. The proposed algorithm firstly, from a given graph G=(V,E), sets vertex $v_i$ of the maximum degree ${\Delta}(G)$ as clique's major vertex. It then selects vertex $v_j$ of ${\Delta}(G)$ among vertices $N_G(v_i)$ that are adjacent to $v_i$, only to determine $N_G(v_i){\cap}N_G(v_j)$ as candidate cliques w and $v_k$. Next it obtains $w=w{\cap}N_G(v_k)$ by sorting $d_G(v_k)$ in the descending order. Lastly, the algorithm executes the same procedure on $G{\backslash}w$ graph to compare newly attained cliques to previously attained cliques so as to choose the lower. With this simple method, multiple independent cliques would also be attainable. When applied to various regular and irregular graphs, the algorithm proposed in this paper has obtained exact solutions to all the given graphs linear time O(n).

An Empirical Study on Click Patterns in Information Exploration (검색결과 역배열 제시를 통한 순서 기반 정보탐색 유형 실증연구)

  • Cho, Bong-Kwan;Kim, Hyoung-Joong
    • Journal of Digital Contents Society
    • /
    • v.19 no.2
    • /
    • pp.301-307
    • /
    • 2018
  • Generally, search engine summarizes the main contents of the search results so that user can click the site providing the information of the contents to search first. In this study, we demonstrated whether the user clicks on the search results based on the summary content provided by the search engine or on the order of the search result placement through empirical studies through the presentation of search results. By using the API provided by the search engine company, a search site that presents the search results in a regular and inverse order is created, and the click action of each user's search result is displayed in the order of actual click order, click position, and the user's search type such as the route of movement. As a result of the analysis, most users account for more than 60% of users who click on the first and second exposed search results regardless of the search results. It is confirmed that the search priority of users is determined according to the order of search results regardless of the summary of search results.