@inproceedings{takahashi2011evaluating, abstract = {We propose a method to evaluate the significance of historical entities (people, events, and so on.). Here, the significance of a historical entity means how it affected other historical entities. Our proposed method first calculates the tempo-spacial impact of historical entities. The impact of a historical entity varies according to time and location. Historical entities are collected from Wikipedia. We assume that a Wikipedia link between historical entities represents an impact propagation. That is, when an entity has a link to another entity, we regard the former is influenced by the latter. Historical entities in Wikipedia usually have the date and location of their occurrence. Our proposed iteration algorithm propagates such initial tempo-spacial information through links in the similar manner as PageRank, so the tempo-spacial impact scores of all the historical entities can be calculated. We assume that a historical entity is significant if it influences many other entities that are far from it temporally or geographically. We demonstrate a prototype system and show the results of experiments that prove the effectiveness of our method.}, acmid = {1995980}, address = {New York, NY, USA}, author = {Takahashi, Yuku and Ohshima, Hiroaki and Yamamoto, Mitsuo and Iwasaki, Hirotoshi and Oyama, Satoshi and Tanaka, Katsumi}, booktitle = {Proceedings of the 22nd ACM conference on Hypertext and hypermedia}, doi = {10.1145/1995966.1995980}, interhash = {6665836546bedb1ee5d56a4d16a0848e}, intrahash = {e4769d86e71c9e7ba77d5d4af6f21e0c}, isbn = {978-1-4503-0256-2}, location = {Eindhoven, The Netherlands}, numpages = {10}, pages = {83--92}, publisher = {ACM}, title = {Evaluating significance of historical entities based on tempo-spatial impacts analysis using Wikipedia link structure}, url = {http://doi.acm.org/10.1145/1995966.1995980}, year = 2011 } @inproceedings{yanbe2007can, address = {New York, NY, USA}, author = {Yanbe, Yusuke and Jatowt, Adam and Nakamura, Satoshi and Tanaka, Katsumi}, booktitle = {JCDL '07: Proceedings of the 2007 conference on Digital libraries}, doi = {http://doi.acm.org/10.1145/1255175.1255198}, interhash = {13ebfc0942b5908890c3caaa7046fe50}, intrahash = {44655301162a726dfb242d32ec622047}, isbn = {978-1-59593-644-8}, location = {Vancouver, BC, Canada}, pages = {107--116}, publisher = {ACM Press}, title = {Can social bookmarking enhance search in the web?}, url = {http://portal.acm.org/citation.cfm?id=1255175.1255198}, year = 2007 } @inproceedings{yanbe2007social, abstract = {Social bookmarking is an emerging type of a Web service that helps users share, classify, and discover interesting resources. In this paper, we explore the concept of an enhanced search, in which data from social bookmarking systems is exploited for enhancing search in the Web. We propose combining the widely used link-based ranking metric with the one derived using social bookmarking data. First, this increases the precision of a standard link-based search by incorporating popularity estimates from aggregated data of bookmarking users. Second, it provides an opportunity for extending the search capabilities of existing search engines. Individual contributions of bookmarking users as well as the general statistics of their activities are used here for a new kind of a complex search where contextual, temporal or sentiment-related information is used. We investigate the usefulness of social bookmarking systems for the purpose of enhancing Web search through a series of experiments done on datasets obtained from social bookmarking systems. Next, we show the prototype system that implements the proposed approach and we present some preliminary results.}, address = {New York, NY, USA}, author = {Yanbe, Yusuke and Jatowt, Adam and Nakamura, Satoshi and Tanaka, Katsumi}, booktitle = {JCDL '07: Proceedings of the 7th ACM/IEEE-CS Joint Conference on Digital Libraries}, doi = {10.1145/1255175.1255198}, interhash = {13ebfc0942b5908890c3caaa7046fe50}, intrahash = {9e3f8071d757c492055744cf03ff4a55}, isbn = {978-1-59593-644-8}, location = {Vancouver, BC, Canada}, pages = {107--116}, privnote = {test}, publisher = {ACM}, title = {Can social bookmarking enhance search in the web?}, url = {http://portal.acm.org/citation.cfm?id=1255175.1255198}, year = 2007 } @inproceedings{1255198, abstract = {Social bookmarking is an emerging type of a Web service that helps users share, classify, and discover interesting resources. In this paper, we explore the concept of an enhanced search, in which data from social bookmarking systems is exploited for enhancing search in the Web. We propose combining the widely used link-based ranking metric with the one derived using social bookmarking data. First, this increases the precision of a standard link-based search by incorporating popularity estimates from aggregated data of bookmarking users. Second, it provides an opportunity for extending the search capabilities of existing search engines. Individual contributions of bookmarking users as well as the general statistics of their activities are used here for a new kind of a complex search where contextual, temporal or sentiment-related information is used. We investigate the usefulness of social bookmarking systems for the purpose of enhancing Web search through a series of experiments done on datasets obtained from social bookmarking systems. Next, we show the prototype system that implements the proposed approach and we present some preliminary results.}, address = {New York, NY, USA}, author = {Yanbe, Yusuke and Jatowt, Adam and Nakamura, Satoshi and Tanaka, Katsumi}, booktitle = {JCDL '07: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries}, doi = {http://doi.acm.org/10.1145/1255175.1255198}, interhash = {13ebfc0942b5908890c3caaa7046fe50}, intrahash = {d896ae22bc7b52edefbfb9cdb373cf83}, isbn = {978-1-59593-644-8}, location = {Vancouver, BC, Canada}, pages = {107--116}, publisher = {ACM}, title = {Can social bookmarking enhance search in the web?}, url = {http://portal.acm.org/citation.cfm?id=1255198}, year = 2007 }