Affected by urbanization, centralization and the decrease of overall population, Japan has been making efforts to revitalize the rural areas across the country. One particular effort is to increase tourism to these rural areas via regional branding, using local farm products as tourist attractions across Japan. Particularly, a program subsidized by the government called Michinoeki, which stands for 'roadside station', was created 20 years ago and it strives to provide a safe and comfortable space for cultural interaction between road travelers and the local community, as well as offering refreshment, and relevant information to travelers. However, despite its importance in the revitalization of the Japanese economy, studies with newer technologies and methodologies are lacking. Using sales data from establishments in the Kyushu area of Japan, we used Support Vector to classify content from Twitter into relevant topics and studied their causal relationship to the sales for each establishment using LiNGAM, a linear non-gaussian acyclic model built for causal structure analysis, to perform an improved market analysis considering more than just correlation. Under the hypotheses stated by the LiNGAM model, we discovered a positive causal relationship between the number of tweets mentioning those establishments, specially mentioning deserts, a need for better access and traffic options, and a potentially untapped customer base in motorcycle biker groups.

A legwork mechanism for improving the retrieval effectiveness of a search engine is proposed. The feedback of relevant/non-relevant information has been shown to be useful to effectively find most of the relevant web pages in the ranked search results. A suggesting module, a type of relevance feedback engine, can do this job fairly well, but does not perform as well when the feedback information is only about non-relevant webpages. In such an unfavorable circumstance the legwork mechanism assists the suggesting module by handing over the relevant information after finding one or more webpages, containing at least one clue keyword. With a slight increase in time required to select the clue(s) in a presented candidate list, a user is able to find relevant webpages more effectively. The effect of the legwork mechanism was evaluated using various search results on the Japanese search engine goo.

Image annotation becomes increasingly more important as the Web continues to grow. We propose a novel approach to enhancing keyword-based Web-image annotation in folksonomy, where a volunteer user is notified what kind(s) of keywords are necessary, and that keywords have been sufficiently provided by other volunteer users. Necessary information is obtained from the keyword-filled facet tables, and sufficient information provided by the quantified conceptual keyword relations. Though the facet tables and the conceptual keyword relations are set by referring to an ontology, users do not need to know its details to successfully annotate the images.

Abstract A model of browsing‐based conceptual information retrieval is proposed employing two different types of dictionaries, a global dictionary and a local dictionary. A global dictionary with the authorized terms is utilized to capture the commonly acknowledgeable conceptual relation between a query and a document by replacing their keywords with the dictionary terms. The documents are ranked by the conceptual closeness to a query, and are arranged in the form of a user's personal digital library, or pDL. In a pDL a user can browse the arranged documents based on a suggestion about which documents are worth examining. This suggestion is made by the information in a local dictionary that is organized so as to reflect a user's interest and the association of keywords with the documents. Experiments for testing the retrieval performance of utilizing the two types of dictionaries were also performed using standard test collections.

A method of assisting a user in finding the required documents effectively is proposed. A user being informed which documents are worth examining can browse in a digital library (DL) in a linear fashion. Computational evaluations were carried out, and a DL and its navigator are designed and constructed.

Article A retrieval system for on-line English-Japanese dictionaries Share on Authors: T. Ito University of Library and Information Science, Kasuga 1-2, Yatabe-machi, Tsukuba-gun, Ibraki-ken 305, Japan University of Library and Information Science, Kasuga 1-2, Yatabe-machi, Tsukuba-gun, Ibraki-ken 305, JapanView Profile , M. Kubota University of Library and Information Science, Kasuga 1-2, Yatabe-machi, Tsukuba-gun, Ibraki-ken 305, Japan University of Library and Information Science, Kasuga 1-2, Yatabe-machi, Tsukuba-gun, Ibraki-ken 305, JapanView Profile Authors Info & Claims SIGIR '87: Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrievalNovember 1987 Pages 181–186https://doi.org/10.1145/42005.42026Published:01 November 1987 1citation369DownloadsMetricsTotal Citations1Total Downloads369Last 12 Months1Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

A spelling program using a hierarchically organized file seems to be promising, since it can correct more than common typing mistakes. However, its speed of detecting spelling errors in the inputs is rather slow. Here some techniques of modifying the program to improve the speed are presented.

A generalized version of a set-theoretical measure for obtaining similarities between patterns with nonindependent attributes is presented. The dependence here is given by the pairwise correlation. Since the proposed measure needs no assumption of attribute independence, the resulting similarity values can reflect directly the relationships between the attributes.

The automatic correction of misspelled inputs is discussed from a viewpoint of similar-string matching. First a hierarchical file organization based on a linear ordering of records is presented for retrieving records highly similar to any input query. Then the spelling problem is attacked by constructing a hierarchical file for a set of strings in a dictionary of English words. The spelling correction steps proceed as follows: (1) find one of the best-match strings which are most similar to a query, (2) expand the search area for obtaining the good-match strings, and (3) interrupt the file search as soon as the required string is displayed. Computational experiments verify the performance of the proposed methods for similar-string matching under the UNIX™ time-sharing system.

A new data structure and a useful basic operation for graph~theoretical algorithms are presented and then applied to the formulation of an algorithm for finding a fundamental set of cycles of an undirected finite graph Comparison is made both analytically and empirically with Paton's cycle-finding algorithm, which is implemented by Gibbs as a PL/I procedure.