RSS
热门关键字:  数据挖掘  人工智能  数据仓库  搜索引擎  数据挖掘导论

Toward Tighter Integration of Web Search with a Geographic I

来源: 作者:unkonwn 时间:2004-12-06 点击:

1 Introduction

Local Web search is attracting much attention recently. Many practical applications have been implemented for searching Web content related to specific regions.

Major search engines and portal sites, such as Google, Yahoo!, Ask Jeeves, and MSN, provide local search services [32][33][34][35][36]. Most of these services, however, are based on what we call the map-and-hyperlink architecture. That is, the Web content and geographic information are weakly bonded: the Web pages only refer to geographic locations in their content. 数据挖掘研究院

A system based on the map-and-hyperlink architecture is illustrated in Figure 1. On one side of the interface, there is a map. On the other side, a list of snippets, the page title, and link URLs are presented. The user can click on the URL, the page title, or a marker on the map to see the linked Web content. 数据挖掘研究院

Figure 1: Map-and-hyperlink architecture


includegraphics[scale=0.25]{Fig/map-and-hyperlink.eps}

Although this architecture is very convenient for the user in many cases, it nevertheless has limited capability in other situations. For example, a user searching for information on restaurants while driving cannot pay much attention to a map interface, since it would take his or her attention away from driving. Another user might want a list of all the restaurants in a certain area. Showing a list of their URLs would not be very satisfactory if the list was extensive, since it would take much time to open all the pages and check their content. Summarizing the content would be more useful. A third user might want to learn about people′s opinions of a region, according to what is being said on the Web. Such information is not provided by existing local Web search systems.

These services can be enabled through the tighter integration of Web search with a geographic information system (GIS). In this paper, we discuss the integration issues in terms of extraction, knowledge discovery, and presentation. We argue that the integration should go beyond the simple map-and-hyperlink architecture, and we support our argument by describing several implementations.

The rest of the paper is organized as follows. We discuss related work in the next section. In Section 3, we give an overview of the tighter integration of Web search with a GIS. In Section 4, we discuss the extraction of geographic information from the Web. Sections 5 and 6 discuss knowledge discovery and presentation, respectively. Finally, Section 7 is the conclusion. 数据挖掘研究院

2 Related Work

There are now a number of local Web search systems open to the public. Most of these are based on the map-and-hyperlink architecture, including those developed both as research projects and as commercial applications. 数据挖掘研究院

A typical example is the system developed by McCurley [1]. The system maps Web pages to geographic locations according to IP addresses, physical addresses, telephone numbers, and other information. The spatial browser consists of a map interface and a regular Web browser. When the user clicks on a point on the map interface, a menu appears, showing the URLs of pages related to that location on the map. 数据挖掘研究院

Larson discussed geographic information retrieval on the Internet [2]. He described the concept of a hypermap, which is a map version of hyperlinks; the maps and geographic content are provided on the Web and linked to each other in a similar manner as with hyperlinks. Plewe also described various means of providing geographic information over the Internet. Most of these means involve map interfaces [3]. 数据挖掘研究院

Many search engines and portal sites now provide local Web search services. Google, Yahoo!, Ask Jeeves, and MSN, to name a few, have their own local search systems. These services are also based on the map-and-hyperlink architecture.

数据挖掘研究院

Google′s local search service, Google Local, shows search results on a map interface [32]. Its geographic database contains the locations of shops, hotels, restaurants, and so forth. Unlike Google′s original Web search engine, Google Local is heavily dependent on databases provided by city information sites, such as CitySearch and WCities [41][42]. In other words, Google Local is more like a city guide system provided on the Web, rather than a system for geographic information retrieval from the Web. MSN City Guides and Ask Jeeves Local also use data from city guide sites [36][35].

Google Earth is another geographic information service on the Web provided by Google [33]. This system provides satelite images for a wide range of the Earth′s surface. It is not linked to local Web content, other than those provided by Google Local.

Yahoo! Local Maps is a map-based local Web search system provided by the major portal site, Yahoo! [34]. It is also integrated with real-time data such as traffic information. AOL Local is a service provided by America Online. It is integrated with AOL′s rich content, including local events and movie information [37].

数据挖掘研究院

In addition to these major Web search engines and portal sites, there are also sites that provide local content as their main feature. CitySearch, mentioned above, provides well-classified regional information, through much effort by its editors [41]. Its database includes information on restaurants, hotels, and various public facilities for a number of U. S. cities. Since it requires human editing, however, it does not contain much of the valuable local information available on the Web. Switchboard provides an Internet version of the yellow pages [38]. Since its search results are not linked to Web content, it only provides a limited amount of information, such as locations and phone numbers. ShopLocal enables users to search local shop information by specifying a city name [40]. MapQuest has its own map interface and provides categorized links to location-related Web sites [39].

There are also services that enable local search of weblog sites and articles. DC Metro Blogmap and nyc bloggers provide services that link one′s personal weblogs, or blogs, to metro maps for Washington D.C. and New York City. With these services, a user can find bloggers located in specific areas in the city [44][45]. There are also services that map each blog entry to a geographic location. Uematsu et al. proposed Ba-log, in which users upload their blog entries by using a cellular phone equipped with a camera and a GPS extension [4]. WorldKit is a toolkit for creating map-based applications on the Web, and it has also been applied to a blog mapping service [43]. These services require manual registration and do not support automatic extraction of information from blog entries. 数据挖掘研究院

3 Tighter Integration of Web Search with a GIS

The aim of this paper is to discuss directions for the deeper integration of Web search and a GIS. Various issues play important roles in improving the user′s experience while obtaining geographic information on the Web. Figure 2 illustrates the issues involved in the integration of Web search with a GIS.

Figure 2: Directions for Web search and GIS integration
includegraphics[width=8cm,clip]{Fig/3d.eps}

One direction of advancement is to increase the amount of data involved. Another is to increase the variety of devices used. Increasing the data quantity enables higher-resolution maps and enhances existing applications. Increasing the variety of devices enables Web search with GIS at any time, anywhere. On the other hand, tighter integration enables entirely new services and experiences for the user. 数据挖掘实验室

Various issues play a role in the integration process, but we have listed the four most significant ones below:

数据挖掘研究院


1: Linking: The simplest integration of Web search with a GIS is to link a Web page to a geographic point or region. Such integration is already implemented in many existing local Web search systems. The user can search Web content by specifying geographic location, and also find location referred by Web content. 数据挖掘研究院


2: Extraction: The extraction of relevant pieces of geographic information from a Web page increases user convenience by eliminating unrelated parts. It also enables further processing of the extracted data for various applications. 数据挖掘研究院


3: Knowledge discovery: The knowledge discovery from Web and GIS is aggregation of extracted information into knowledge on geographic space. The aggregation creates knowledge that is not available in a conventional GIS. 数据挖掘研究院


4: Presentation: Presenting URLs and snippets along with a map interface is the most common presentation scheme in local Web search systems. However, more useful ways of presenting Web search results with geographic information can be investigated.

数据挖掘研究院

Since linking is already provided by many local Web search systems, we focus on the last three issues in this paper.

4 Extraction

The extraction of information from local Web search results is one of the most important issues in local Web search. At present, most local Web search systems retrieve Web pages as the search results. In many cases, however, only part of a retrieved page contains regional information. Extraction of that regional information would make the presentation to the user more efficient.

Extraction of parts of Web pages has been investigated by several groups. Sagara et al. built a system that extracts geographic terms from Web content, enabling geographic searching [5]. Woodruff and Plaunt developed the Geo-referenced Information Processing SYstem (GIPSY), which parses Web documents and assigns coordinates to each page [6]. Yang and Claramunt mined user preferences regarding sightseeing spots for tourism applications[27].

Several methods can be used for extraction of geographic information: 数据挖掘研究院


* simple text matching; 数据挖掘研究院


* natural language processing of text, such as morphological analysis and structural analysis; 数据挖掘研究院


* ontology-based extraction, such as using dictionary data.
数据挖掘研究院

We next describe an application that extracts snippets of local information from Web pages.

数据挖掘研究院

1 Blog Map of Experiences

Information on what people experience at sightseeing spots is often unavailable from city guides. Such information should be of interest to tourists, however, because it would help them plan their trips. The Web is one of the best sources for gathering this type of information. We previously developed a system that extracts the region-specific experiences of people from weblogs. 数据挖掘研究院

The prevalence of blogs enables the accumulation of personal experiences specific to location and time. Such information has traditionally been unavailable, except indirectly through commercial city guides, local newspapers and periodicals. This kind of information is particularly valuable for potential tourists and marketing analysts interested in local trends. In addition, each blog entry has the time it was published as an attribute. This enables the extraction of the writer′s experiences during a specific time period. When combined with the extraction of geographic keywords from blog entries, tourist experiences related to a specific place and time can be obtained. For example, in spring, many people visit various locations to enjoy flower blossoms. At famous sightseeing spots, a certain percentage of people enjoys local specialties. Such information is formalized as rules among place, time, action, and object. We implemented a system, the Blog Map of Experiences, which extracts these rules from blog entries and present them visually. The system′s configuration is illustrated in Figure 3.

数据挖掘研究院

Figure 3: Blog Map of Experiences
includegraphics[width=8cm,clip]{Fig/systemConfiguration.eps}

The aim of the Blog Map of Experiences is to present tourists′ real-life experiences through a map interface, in an integrated manner. Compared to conventional local information search systems, the Blog Map of Experiences has two notable features. One is that the results are based on information provided directly from a large number of blog authors. The other is that both the type of experience and the time, in addition to the location, can be specified in a search query.

数据挖掘实验室

Since not all of the blog entries refer to users′ experiences, we restrict the search to phrases that involve actions. The following subsection describes the extraction process in detail.

2 System Architecture

The system first collects blog entries from blog search engines. The collected blogs are stored in a database. The system performs morphological analysis to each entry, in which sentences into words and their parts of speech are estimated. 数据挖掘实验室

Sentences containing these verbs indicating motion are eliminated, since their original sentences likely described motion toward a location, rather than actions at the location, which are what we want to extract and present to the users. As preprocessing for the association rule mining, which is done using the APRIORI algorithm [8], the time attributes of the entries were grouped by month, so that the resulting association rules would have higher support values.

数据挖掘研究院

Three types of rules can be extracted:
数据挖掘研究院

Type 1: [ Time, Place ] $ Rightarrow$ [ Action ]

Type 2: [ Time, Place, Action ] $ Rightarrow$ [ Object ] 数据挖掘研究院

Type 3: [ Time, Place ] $ Rightarrow$ [ Action, Object ]
数据挖掘研究院

Other rules, such as those between actions, were not used in this system, because they do not match our goal of extracting spatially and temporally specific experiences. 数据挖掘研究院

The results of a preliminary experiment showed that Type-3 rules contain too much noise and could not be used without further improving the refinement methods. The precisions of these rules were around 10%. 数据挖掘研究院

The extraction is performed in two steps. First, Type-1 rules are extracted, and a set of typical verbs for a given place name is obtained. Second, Type-2 rules are extracted for pairs consisting of the given place name and the extracted typical verbs.

The process is described by the following pseudocode:

Code: Experience extraction 数据挖掘研究院

Define a place name set $ P = {p_{1},...,p_{n}}$ .

数据挖掘研究院

For $ i$ = 1 to $ n$ do 数据挖掘研究院

Obtain $ m$ association rules $ p_{i}
ightarrow v$ , 数据挖掘研究院

in decreasing order of support. 数据挖掘研究院

Obtain the set of verbs $ V_{i} = {v_{i1},...,v_{im}}$

For $ j$ = 1 to $ m$ do

Obtain $ k$ association rules $ p_{i},v_{ij} 
ightarrow n$ , 数据挖掘研究院

in decreasing order of support.

数据挖掘研究院

Store $ k$ rules. 数据挖掘研究院

Done 数据挖掘研究院

Done 数据挖掘研究院


After the extraction, we refine the results in two ways:
数据挖掘实验室

Refinement 1: Identify and extract sentences referring to actions.

数据挖掘研究院

Refinement 2: Eliminate sentences indicating movement from one place to another.
数据挖掘研究院

The former refinement is applied because sentences referring to the states of the objects are not needed. The latter refinement is applied because our goal is to extract experiences at certain places, not in between. 数据挖掘研究院

The results are then stored in a rule database and presented to the user in various formats.

Figure 4 shows an example user interface for the Blog Map of Experiences system.

Figure 4: User interface for the Blog Map of Experiences system

3 Evaluation

We evaluated our system on real data. First, we manually listed 20 popular sightseeing spots in Japan and collected 500 blog entries for each. In collecting blog entries, we used ``goo blog′′ and ``livedoor blog′′ [46][47], which are typical blog hosting services in Japan. The place names used in search queries are taken from digitized residential maps provided by Zenrin Co., Ltd. [48].

数据挖掘研究院

For morphological analysis, we used Chasen morphological analyzer [50]. We obtained a collection of verbs referring to actions from the lexical database of the Japanese Vocabulary System [51] and categorized the verbs into a tree structure, with verbs referring to actions grouped into one top-level category. We then manually selected verbs that indicate movement. For example, verbs such as ``go,′′ ``come,′′ and their synonyms are in the list. 数据挖掘研究院

The Type-1 rules were extracted, and the top $ j$ rules were obtained in decreasing order of support value. Next, the Type-2 rules were extracted for each of the verbs that were the consequents of the Type-1 rules, and the top ten nouns that were the consequents of the Type-2 rules were obtained. We calculated the average precision of the extracted pairs of verbs and nouns, i.e., the association rules. As shown in Table 1, the combination of Refinements 1 and 2 improved the precision of the rule set. 数据挖掘研究院


数据挖掘研究院

Table 1: Average precision of the extracted association rules
Top $ j$ Size Unrefined Refined by 1 Refined by 1+2
3 30 0.007 0.083 0.216
5 50 0.058 0.111 0.221
10 100 0.087 0.131 0.182

数据挖掘实验室


The extracted rules can be used to recommend visitors popular activities at sightseeing spots, and also to provide analysts with means to observe local trends.

5 Knowledge Discovery

Knowledge discovery is another significant topic in integrating Web search with a GIS. Aggregating extracted information into knowledge helps users learn the characteristics of a region more efficiently.

Although knowledge discovery has been widely studied in the database field, applications specific to the Web and to geographic information are limited [9]. Koperski described a method for knowledge mining in the geographic domain, yet Web content was not involved[12]. Buyukkokten et al. observed a bias in the locations of sites linked to various newspaper sites [11]. They compared the IP addresses of sites linked to the New York Times and the San Francisco Chronicle and found that the sites were more widely distributed for the New York Times. This is an example of regional knowledge obtained through Web mining. 数据挖掘研究院

There are different ways to obtain valuable geographic knowledge from the Web, as indicated below: 数据挖掘研究院


* by summarizing the content into an overview;


* by removing the overlaps among content; 数据挖掘研究院


* by identifying rules or patterns (i.e., association rules) in the content;


* by identifying the statistical tendencies in the content data.
数据挖掘研究院

We next describe a system that creates one of the simplest kinds of geographic knowledge, the cognitive significance of a place name. Focusing on a simple type of knowledge enables the system to obtain knowledge with a relatively small amount of data.

数据挖掘研究院

1 Place Name Ranker

In general, maps present place names that are significant within its region. Significance of a place name is cognitive information, rather than physical information. Usually, mapmakers select place names for a map manually. This is a labor intensive task, especially for a city map, where frequent updating is necessary. A selection is based on a subjective judgment, and may not match intuitions of many users. In addition, the result of a selection is qualitative, dividing place names into significant ones and non-significant ones. If the cognitive significance of place names were measured quantitatively, place names presented on a map can dynamically be selected as a map zooms. 数据挖掘研究院

The term landmark is often used to indicate a cognitively significant geographic object [20][21]. Landmarks have been studied as a part of a cognitive map, which is a mental model of geographic space that a person has in mind [17][18][19]. Such cognitive information is important in applications that involves human behavior on a geographic scale. This is indicated in that maps without names of significant geographic objects are often inconvenient for daily use.

数据挖掘研究院

Since the value of cognitive significance for a place name is a type of information that is not present in an ordinary GIS, we considered it an appropriate target for knowledge discovery from the Web.

We implemented a system, Place Name Ranker, which ranks place names by their significance based on the way they appear on Web content. The method applies conventional text mining techniques to Web pages collected by a Web crawler. Although the cognitive significance of a geographic object is a subjective measure differing from person to person, we assumed that the average figure is still useful for many applications. The following subsections define measures which are expected to represent the cognitive significance of geographic objects.

1 Document Frequency

The document frequency (DF) of a term is defined as the number of documents (Web pages) that contain the term. This measure is commonly used in text mining [14]. It is calculated as follows: 数据挖掘研究院

$displaystyle d(p_{i}) = vert{d in Dvert p_{i} in s wedge s in d }vert,$ (1)


where $ p_{i}$ indicates the target place name (for which the DF is calculated), $ D$ is the document set, and $ s$ is a sentence. This is one of the simplest measures of word frequency in a set of documents.

2 Regional Co-occurrence Summation

A shortcoming of the DF is that it does not examine whether a place name is used in a spatial context or not. Therefore, branches of enterprises, universities, or chain stores are often highly ranked in terms of DF. To avoid this, we need to measure the frequency with which a place name is actually used in a spatial context. We do this by calculating the regional co-occurrence summation (RS). We assume that when two neighboring place names appear in the same document, they likely are both used in a spatial context. In terms of text mining, we consider the co-occurrence of two neighboring place names to be an indicator of spatial context. Co-occurrence is a commonly used measure for term relationships in text mining [14,16].

数据挖掘研究院

The RS is defined as the total number of co-occurrences that the target place name has with the surrounding place names. Before calculating it, we must first define the surrounding place names. We call this set the physical proximity of the target place name. One way to define this is to use a threshold distance:

$displaystyle P′(p) = {p_{i}vert p_{i}in P_{all} wedge delta(p,p_{i})leq R wedge p_{i} 
ot= p },$ (2)


where $ p$ is the target place name, $ P′$ is the threshold-based physical proximity, $ P_{all}$ is the original set of place names, the function $ delta$ gives the distance between place names, and $ R$ indicates the threshold distance.

This simple model, however, is inappropriate if the target area contains both dense and sparse distributions of place names, because some place names will have a large number of neighboring place names and others will have only a few. As a result, this measure will have low reliability. 数据挖掘研究院

We thus define the physical proximity instead as the set of $ n$ -closest place names from the target place name. Such a set can be obtained by sorting the place names according to their distances from the target place name:

$displaystyle P(p) = {p_{i}vert p_{j}in P_{all} wedge delta(p,p_{j}) leq delta(p,p_{j+1})wedge 1leq ileq n wedge p_{i} 
ot= p}.$ (3)

Next, the formula for the RS is 数据挖掘研究院

$displaystyle r(p_{i}) = sumlimits_{p_{j}in P(p_{i})} kappa(p_{i},p_{j}),$ (4)


where $ kappa(p_{i},p_{j})$ is the number of documents (Web pages) containing both $ p_{i}$ and $ p_{j}$ . In other words, $ kappa(p_{i},p_{j})$ is the number of co-occurrences between $ p_{i}$ and $ p_{j}$ , in terms of documents.

The use of the RS reduces the effect of ambiguity in place names. Suppose that place name $ a$ indicates two different coordinates, $ x_{a}$ and $ x_{a′}$ , while place name $ b$ indicates coordinate $ x_{b}$ . Suppose also that the distances between the three coordinates follow the order $ igvert x_{a}-x_{b} igvert <igvert x_{a′}-x_{b} igvert$ . If $ a$ and $ b$ co-occur in document $ A$ , $ a$ in document $ A$ likely refers to coordinate $ x_{a}$ , rather than to $ x_{a′}$ . Because the DF does not account for such ambiguity, we expect the RS to perform better than the DF in extracting significance in a spatially restricted sense.

Although various distances can be defined (i.e., the network metric distance and the time distance), we use the Euclidean distance between coordinates, since the data necessary for calculating the other distances are not as easily obtained for many regions. 数据挖掘实验室

2 System Architecture

Based on these two measures, we implemented our Place Name Ranker system. The main components are shown in Figure 5. The basic data used by the system are (1) place names and their coordinates from a GIS and (2) text content from the Web. 数据挖掘研究院

Figure 5: Architecture of Place Name Ranker


A focused crawler is a special type of Web crawler that collects pages that only fulfill certain conditions. In other words, links are traced only when a page satisfies these conditions. The conditions can include the existence of certain keywords or high similarity to given example pages. Focused crawlers have been reported to have higher efficiency in retrieving Web pages for certain topics [13]. The underlying assumption is that pages concerning certain topics are more likely to be linked to pages discussing the same topic.

Because our objective is to extract significant place names for a certain target region, we use a focused crawler for efficient retrieval, and we set one condition-the page must contain at least one place name from within the region of interest. Due to the ambiguity of place names, not all of the retrieved pages will discuss the target region. Nevertheless, the ratio of related pages is higher than with a conventional crawler. 数据挖掘研究院

After measuring the values for cognitive significance, the map interface presents the place names with the top $ k$ measured values.

3 Evaluation

We tested this system by determining how well it could assign values to place names. To evaluate the appropriateness of the proposed measures, DF and RS, we performed an experiment using the data indicated below.


Participants: 36 residents of the target region, plus 14 people from outside the region.


Responses: Each participant was asked to select the 20 most significant place names in the target region. The result contained 275 distinct place names. 数据挖掘研究院


GIS data: The place name data were taken from a regular GIS, a digitized residential map for Kyoto, Japan, provided by Zenrin Co., Ltd. [48]. The map data were divided into layers, including a ``significant objects′′ layer containing 7109 place names. Although we could assume objects in this layer to be significant, their levels of significance varied. Famous temples and ordinary elementary schools were all included in the same layer, and no quantitative value of significance was assigned to the objects. Our goal in this experiment was to see if the system could assign a significance value to each of these names. 数据挖掘研究院


Web documents: As a document set, we used 157,297 Web pages collected by the focused crawler. Only the text parts were used in the information extraction. The total data size was 2.45 GB. To calculate the DF, we used the Namazu full-text search engine [49]. Prior to the search, we added place names taken from the GIS to the Namazu indexed word list. The RS was calculated in the same manner.

数据挖掘研究院

We used precision and recall to evaluate the two proposed measures. The definitions for the precision and recall are as follows: 数据挖掘研究院

Precision$displaystyle = frac{mbox{No. of Retrieved Correct Objects}}{mbox{No. of Retrieved Objects}},$ (5)

Recall$displaystyle = frac{mbox{No. of Retrieved Correct Objects}}{mbox{No. of Correct Objects in Population}}.$ (6)

数据挖掘研究院



We sorted the place names taken from the GIS in decreasing order of the two measures. Rank position $ k$ indicates that the precision and recall were calculated for the top $ k$ entries in the ranking. If $ k$ was small, the set was likely to have high precision and low recall, while if $ k$ was large, the opposite situation was likely. The precision and recall are functions of $ k$ . A precision-recall curve (P-R curve) is commonly used to visualize a series of precision and recall pairs obtained by varying $ k$ [16]. 数据挖掘研究院

We then sorted the place names from the GIS in decreasing order of the calculated DF and RS values. The top $ k$ place names were selected, and their precision and recall values were calculated with respect to a set of significant place names judged manually. 数据挖掘研究院

We graphed the points where the recall increased in order to make the P-R curve smooth. By renumbering the extracted pairs, we obtained a series of P-R pairs as a function of a new parameter, $ j$ . We then averaged the P-R pairs collected from different participants for each $ j$ and obtained an averaged P-R curve. This curve was a function of $ j$ . This method is called averaging by micro-evaluation [16]. The value of $ k$ ranged from 1 to 7109 (= the number of significant place names in the GIS), $ j$ ranged from 1 to 20 (= the number of ``correct answers′′ given by each participant), and the number of P-R pairs (to be averaged) was 50 (= the number of participants).

The averaged P-R curves for the DF and the RS are shown in Figure 6, and the precisions at different rank positions are listed in Table 2. These results indicate that that RS performed relatively well as a measure for evaluating the cognitive significance of place names, especially when compared to the DF. A more detailed discussion is given elsewhere [31]. 数据挖掘研究院

Figure 6: P-R curves for the DF and the RS


includegraphics[width=8cm,clip]{Fig/df-rs.eps}


数据挖掘实验室

Table 2: Precisions at different rank positions
Rank pos. DF RS
5 0.016 0.368
10 0.140 0.212
15 0.096 0.259
20 0.106 0.239

数据挖掘研究院


The results show that by selecting an appropriate measure, geographic knowledge can be effectively extracted from the Web. 数据挖掘研究院

6 Presentation

A map interface is not the only way to present the result of local Web search. There are various other means of presentation, in different styles and media.

A number of methods have been proposed as new presentation schemes for geographic information, especially for presentation on mobile devices Since mobile devices have limited display capacity, the presentation method is of great importance. Kim et al. implemented a mobile tour-guide system that automatically finds Web services and presents the integrated results on a map interface [23]. Gardiner and Carswell developed a system that processes directional queries with respect to the user′s view [24]. Their Cultural Heritage Interface enables the user to obtain information about locations by specifying directions with respect to himself or herself. Huang et al. implemented a system that integrates a GIS, virtual reality (VR), and the Internet through the Virtual Reality Modeling Language (VRML) [

最新评论共有 0 位网友发表了评论
发表评论
评论内容:不能超过250字,需审核,请自觉遵守互联网相关政策法规。
匿名?