@article {308,
	title = {A retrieval method based on language model considering neighboring contents},
	journal = {Journal of Digital Information Management},
	volume = {10},
	year = {2012},
	note = {Export Date: 10 July 2014},
	month = {2012},
	pages = {1 - 9},
	abstract = {The World Wide Web (WWW) has a massive number of Web pages, so that it is difficult for users to get useful information. In recent years, however, it is said that the probabilistic language model can help to improve retrieval accuracies of some kinds of search engines. The probabilistic language model has statistical background and can adapt previous text information retrieval model. However, we cannot directly adapt the probabilistic language model to Web search engines, because data on the Web has a hyperlink environment while the probabilistic language model can only text information on it. In this paper, we propose a novel approach for searching Web pages considering a Web page as well as its neighboring oneson the hyperlink environment.},
	keywords = {Hyperlink Analysis, Language Model, Web search},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84857609599\&partnerID=40\&md5=78bc4a283c5231cf36f479f17c8ab0e5},
	author = {Tamura, K. and Hatano, K. and Yadohisa, H.}
}
@article {255,
	title = {Mining the blogosphere to generate cuisine hotspot maps},
	journal = {Journal of Digital Information Management},
	volume = {8},
	year = {2010},
	note = {Cited By (since 1996):1Export Date: 10 July 2014},
	month = {2010},
	pages = {396 - 401},
	abstract = {Choosing a restaurant is one of the most frequent decisions faced in modern daily life; however, it is difficult for consumers to choose between food/restaurant by reading large amounts of reviews. This study attempts to generate cuisine hotspot maps through blog content mining to help consumers make restaurant decisions by specialties. The main obstacle in doing this involves recognizing and extracting restaurants and essentialrestaurant information (i.e., restaurant dishes) in unstructured content. In contrast to traditional Named Entity Recognition (NER) targets, dish name is a promising target that received little attention in previous studies. This study develops methods for recognizing and extracting restaurant names and dish names from review postsin the blogosphere and achieves satisfactory performance. Based on the method, we processed more than 12,000 Chinese blog posts and generated a cuisine hotspot map. The map shows the most popular dishes of restaurants in a map-view to help consumers make restaurant decisions. A prototype of cuisine hotspot map, named CuisineGuide, is implemented and available as an iPhone application.},
	keywords = {Blog analysis, Hotspots, Name entity recognition, Web content, Web search},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960266928\&partnerID=40\&md5=4f85ee81adec856534db4c96673f0dbe},
	author = {Shih, C.-C. and Peng, T.-C. and Lai, W.-S.}
}
@article {102,
	title = {Pre-processing and Path Normalization of a web graph used as a social network},
	journal = {Journal of Digital Information Management},
	volume = {5},
	year = {2007},
	note = {Cited By (since 1996):2Export Date: 10 July 2014},
	month = {2007},
	pages = {262 - 276},
	abstract = {Many efforts have been made for compression of web graphs. Most of these methods are suitable for search engines and are centered around encoding links and URLs efficiently. The purpose is to handle a large set of web pages in the main memory against any web based search. The authors of the present paper are interested in studying web graph as a social network and to develop a data model for it. So, suitable compression techniques, which are space efficient for disk based storage, are required. This paper has provided a two level compression technique. In the first level, the structural properties of a graph are studied and strongly connected components are fused to reduce the original graph to a DAG. Paths on this DAG are then stored efficiently using a Path Normalization technique. Space complexity expressions indicate the efficiency of the method. Relevant operators required for accessing the original graph through the compressed representations have also been discussed. Important earlier works have been referred to indicate the requirements of the present approach.},
	keywords = {Compression technique, Path normailisation technique, Social software, Web search},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-57949092373\&partnerID=40\&md5=08a3428b63ad14c630820944a0e9c222},
	author = {Teja, C.B. and Mitra, S. and Bagchi, A. and Bandyopadhyay, A.K.}
}
@article {52,
	title = {On the use of ontologies for an optimal representation and exploration of the web},
	journal = {Journal of Digital Information Management},
	volume = {4},
	year = {2006},
	note = {Cited By (since 1996):5Export Date: 10 July 2014},
	month = {2006},
	pages = {159 - 168},
	abstract = {The use and definition of ontology for the representation and the exploration of knowledge are critical issues for approaches dealing with information retrieval. In this paper, we propose a new ontology-based approach for improving the quality, in terms of relevance, of the results obtained when searching documents on the Internet. This is done by a coherent integration of ontologies, Web data and query languages. We propose new data structures built upon ontologies: the WPGraph and the W 3Graph which allow Web data to be modelled. We also discuss the use of ontologies for an efficient exploration of the knowledge contained in our conceptual structures using ASK, a specific query language introduced in this paper. An experimental validation of our approach is proposed through a prototype supporting our innovative framework.},
	keywords = {Conceptual structures, Graphs, Ontology, Query language, Web search},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33749389716\&partnerID=40\&md5=2881871777661cd78d3507f448bedc32},
	author = {Guelfi, N. and Pruski, C.}
}
