Tetsuya Oishi

Kyushu University, Fukuoka-shi, Fukuoka-ken, Japan

Are you Tetsuya Oishi?

Claim your profile

Publications (10)0 Total impact

  • ICAART 2011 - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence, Volume 1 - Artificial Intelligence, Rome, Italy, January 28-30, 2011; 01/2011
  • ICAART 2011 - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence, Volume 1 - Artificial Intelligence, Rome, Italy, January 28-30, 2011; 01/2011
  • [Show abstract] [Hide abstract]
    ABSTRACT: When searching for information a user wants, search engines often return lots of results unintended by the user. Query expansion is a promising approach to solve this problem. In the query expansion research, one of the biggest issues is to generate appropriate keywords representing the user’s intention. The Related Word Extraction Algorithm (RWEA) we proposed extracts such keywords for the query expansion. In this paper, we evaluate the RWEA through several experiments considering the types of queries given by the users. We compare the RWEA, Robertson’s Selection Value (RSV) which is one of the famous relevance feedback methods, and the combination of RWEA and RSV. The results show that as queries become more ambiguous, the advantage of the RWEA becomes higher. From the points of view of query types, the RWEA is appropriate for informational queries and the combined method is for navigational queries. For both query types, RWEA helps to find relevant information.
    10/2010: pages 33-48;
  • ICAART 2010 - Proceedings of the International Conference on Agents and Artificial Intelligence, Volume 2 - Agents, Valencia, Spain, January 22-24, 2010; 01/2010
  • [Show abstract] [Hide abstract]
    ABSTRACT: When searching for information a user wants, search engines often return lots of results unintended by the user. Query expansion is a promising approach to solve this problem. In the query expansion research, one of big issues is to generate appropriate keywords representing the user's intention. This paper proposes the related word extraction algorithm (RWEA) which pays attention to the distance between sentences where keywords in the original query appear. The RWEA is based on the idea that a word nearby important words is also important. We conducted several experiments to evaluate the RWEA. The results promise the effectiveness of the RWEA for improving search results.
    Web Intelligence and Intelligent Agent Technology, 2008. WI-IAT '08. IEEE/WIC/ACM International Conference on; 01/2009
  • [Show abstract] [Hide abstract]
    ABSTRACT: When searching for intended pages on the Internet, users often have a hard time to find the pages because the pages do not always come at the higher rank of searched results. The Personalized Search is a promising approach to solve this problem. In the Personalized Search, User Profiles (UPs in short) that represent interests of the users, are well used and often created from personal documents of the users. This paper proposes (1) a method for making UPs based on Open Directory Project (ODP) and shows (2) a Personalized Search system using the UPs made from Book Marks. Some of experimental results illustrate the validity of our method for making the UPs, and show the precision enhancement of this system.
    PRICAI 2008: Trends in Artificial Intelligence, 10th Pacific Rim International Conference on Artificial Intelligence, Hanoi, Vietnam, December 15-19, 2008. Proceedings; 01/2008
  • [Show abstract] [Hide abstract]
    ABSTRACT: In Web retrieval, it is often the case that the results given by search engines are not just what we want. To solve this problem there have been many studies on improving queries to be submitted to search engines. However, they are still insufficient due to lack of consideration on time information. To remedy this we propose a user-schedule-based Web page recommendation method. The method makes use of a user's schedule to make the recommendation suite to his/her requests. In addition, an algorithm for extracting related words is introduced as a key technique in this method. Some preliminary experiments show very promising results in recommending Web pages relevant to users requests. We also confirmed that this algorithm outperforms a method using mutual information.
    Web Intelligence, IEEE/WIC/ACM International Conference on; 12/2007
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: 複数サービス向けの認証や認可システムには個人情報や属性情報が集中する上に,どのサービスをいつ利用したかという履歴も残るため,これらのシステムに対するプライバシー保護は重要である.本稿では,プライバシー保護を可能にしつつ,複数のサービスに対する認証及び認可機能を提供するシステムを提案する.まず,認証や認可における必要な情報を議論し,プライバシー保護に必要な要件を抽出する.次に,この要件を満たす認証認可システムを提案する.提案システムでは情報は分散され,個人特定ができないようする.さらに,プライベート情報検索と呼ばれる技術を応用し,認証局等に対し,誰の認証が行われているかを秘匿しつつ認証や認可を行うことを可能にする. A system for authentication or authorization maintains log data which records when someone uses some service, in addition to personal information, and therefore privacy protection for such a system is mandatory. In this paper, we develop an infrastructure system which provides authentication and authorization functions to multiple services, protecting privacy of users of the services. After deriving requirements for the privacy protection, we develop the system satisfying the requirements. In the proposed system, because information is divided into different subsystems, it is difficult for such a subsystem to identify an individual. The proposed system also utilizes Private Information Retrieval to prevent a subsystem identifying an individual who request an authentication process.
  • [Show abstract] [Hide abstract]
    ABSTRACT: http://www.tulips.tsukuba.ac.jp/mylimedio/dl/page.do?issueid=1031725&tocid=100089814&page=42-53
    http://www.dl.slis.tsukuba.ac.jp/DLjournal/No_38/.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: With the motivation of developing a system that sup- ports communications of researches in various disci- plines, this paper devotes to analyze requirements for such a system through operation of a prototype system. To develop a desired system, we clarify basic require- ments for the system, discussing what communications of researches are. We have developed a prototype sys- tem, based on a social networking system, that satisfies these requirements, offered it to our faculty members, and obtained some interesting findings which must be useful for the desired system. The findings include im- portance of identifiers which are opaque and can be se- lected by users instead of some centralized or hierarchi- cal organizations. non-deliverables, and many of the communications are conducted within fixed groups and thus the number of consumers is limited. In this sense, we call the commu- nication in research processes research communication instead of scholarly communication. Existing systems for scholarly communication support only a part of re- search communication. With the motivation of devel- oping a system supporting research communication, the goal of this paper is to obtain requirements of such a system. To extract requirements, we have developed a proto- type system based on an open source social networking system, offered it to our faculty members. We report some interesting findings obtained from operation of the prototype system.