JP2003248696A - Page rating/filtering method, device, and program, and computer readable recording medium recording the program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a page rating/filtering method, a device, and a program capable of efficiently and appropriately rating and filtering an object page using link pass information and to provide a computer readable recording medium recording the same program. <P>SOLUTION: This page rating/filtering device stores hyperlink information comprising the link pass information, or the link of URLs of respective pages to be a standard, in a DB part 101, allows a pass search part 102 to search the link pass information stored in the DB part 101 from the object page, allows a page rating part 103 to rate whether or not the object page accords with a prescribed standard relative to the link pass information stored in the database, and filters the object page based on the rating result. <P>COPYRIGHT: (C)2003,JPO

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a page rating / filtering method and apparatus for rating and filtering documents using link information between documents, and more specifically, to a standard set for a certain target page in advance. Page rating / filtering method and apparatus for performing a rating on the degree of association and filtering based on the rating result, a page rating / filtering program, and a computer-readable recording medium storing the program. Regarding

[0002]

2. Description of the Related Art When a user wants to obtain only content belonging to a certain category or does not want to obtain only content belonging to a certain category, a technique called content filtering and rating has been used. Rating certain content means rating information according to certain criteria. Filtering is the selective reception of information according to the criteria set by the recipient.

In order to do these, it is a rating to calculate a score for the content according to a certain standard and to rate the content based on the score, and based on the score, the content is information desired by the user, or Filtering determines whether the information is unwanted information. Examples of applying filtering to the browsing of web pages on the Internet include a case where a parent limits the web pages that can be browsed by children, and a case where the parent is restricted from browsing web pages not related to work. There is.

However, in general, filtering is often performed based on the result of rating, and rating and filtering are used as words having similar meanings. In other words, this is because the content is rated as “Browsing prohibited under the age of 18” (rating), and according to the rating, it is determined that the content is not desired by the user (filtering).

Conventionally, there are (1) a word-based method and (2) a content designating method (URL designating method) as a method of scoring the content when performing the rating and the filtering.

In the word-based method, scoring is performed depending on whether or not a certain content contains a designated word.

The content designating method is a method of designating content in a certain category as a criterion for rating and filtering. That is, for example, in limiting the content to be viewed by the user, have specified whether to browse previously which content to the user as viewable content, when the user attempts to view the content, viewable its contents If the content is specified, it will be viewed. For example, if it is a Web page on the Internet, the page http: //www.xxx.yyy/ is specified not to be browsed, and the page is not displayed even if the user tries to browse the page.

[0008]

Among the conventional methods described above, the word-based method has the following problems.

(1) The user needs to specify a word in advance.

(2) Not applicable to images and music data.

(3) It can be applied only to contents including words, and it is necessary to keep updating the designated word, that is, keep registering new words.

(4) In the Internet and the like, words (new words / unknown words) that have not been used conventionally are used very frequently, and it is not possible to deal with them. For example,
There are many examples on the Internet where the word "cut off" starts to be used not only in the conventional sense of "cutting off an object" but also in the sense of "getting angry". In order to deal with this, it is necessary to continuously update, and it is better that the update frequency is more frequent.

(5) If another word "A '" having the same meaning is used instead of the previously designated word "A", it cannot be dealt with.

Further, the content designating method has the following problems.

(1) New contents cannot be supported.

(2) Since only the specified content can be dealt with, the content does not exist at the time of specifying the content, and the content that appears after that cannot be specified much.

The present invention has been made in view of the above,
The purpose thereof is to provide a page rating / filtering method and apparatus capable of efficiently and accurately rating and filtering a target page using link path information, a page rating / filtering program, and a computer readable recording program thereof. To provide a suitable recording medium.

[0018]

In order to achieve the above-mentioned object, the present invention according to claim 1 performs a rating as to how much a certain target page is related to a preset standard. A page rating / filtering method for filtering a target page based on a rating result, wherein hyperlink information composed of link path information which is a link of URLs of respective pages serving as the criteria is stored in a database,
The link path information stored in the database is retrieved from the target page, and the target page is rated for the link path information stored in the database to determine whether or not the link path information is stored in the database, and based on the rating result. The gist is to filter the target page.

According to the first aspect of the present invention, hyperlink information including link path information, which is a link of URLs of standard pages, is stored in a database, and the link path stored in the database from the target page. Information is searched for, whether or not the target page matches the predetermined criteria with respect to the link path information stored in the database, and the target page is filtered based on this rating result. If only the URL group of the page is designated, the degree of association between the designated URL group and the target page can be determined, and the target page can be filtered efficiently and accurately.

The present invention according to claim 2 is the same as claim 1
In the described invention, the rating is each URL that constitutes link path information stored in the database.
The summary is that it is performed based on the degree of association of the target page with.

Further, the present invention according to claim 3 provides the invention according to claim 2.
In the invention described above, the degree of association is a hyperlink from each URL forming the link path information to a target page, and a search is made to see if there is a route that can reach the target page. The gist is that the shorter the relationship, the higher the degree of association.

According to a fourth aspect of the present invention, in the invention according to the second aspect, a route in which the degree of association can reach the target page by following a hyperlink from each URL constituting the link path information to the target page. The gist is to search whether or not there is a route and, if there is a route, to search all reachable routes, and assume that the more routes there are, the higher the degree of association is.

The present invention according to claim 5 performs a rating as to how much a certain target page is related to a preset standard, and a page for filtering the target page based on the rating result. A rating / filtering device, which searches a database for storing hyperlink information, which is link path information that is a link of URLs of respective pages serving as the standard, and link path information stored in the database, from the target page. A path search unit, a rating unit for rating whether or not the target page matches a predetermined criterion with respect to the link path information stored in the database, and a filtering unit for filtering the target page based on the rating result. Required to have To.

In the present invention according to claim 5, hyperlink information, which is link path information that is a link of URLs of standard pages, is stored in a database, and the link path stored in the database from the target page. Information is searched for, whether or not the target page matches the predetermined criteria with respect to the link path information stored in the database, and the target page is filtered based on this rating result. If only the URL group of the page is designated, the degree of association between the designated URL group and the target page can be determined, and the target page can be filtered efficiently and accurately.

Further, the present invention according to claim 6 provides the invention according to claim 5.
In the invention described above, each of the U's forming the link path information stored in the database by the rating means.
The gist is to have a degree-of-association calculating unit that calculates the degree of association of the target page with the RL and a unit that performs rating based on the calculated degree of association.

A seventh aspect of the present invention is the route according to the sixth aspect, wherein the degree of relevance can reach the target page by following a hyperlink from each URL forming the link path information to the target page. The gist is to search for whether there is any, and the shorter the distance along this route, the greater the degree of association.

The present invention according to claim 8 provides the invention according to claim 6.
In the invention described above, the degree of relevance is a hyperlink from each URL forming the link path information to the target page to search for a route to reach the target page. If there is a route, The gist is that all reachable routes are searched, and the more routes there are, the higher the degree of association is.

Further, the present invention according to claim 9 performs a rating as to how a certain target page is related to a preset standard, and a page for filtering the target page based on the rating result. A rating / filtering program, wherein hyperlink information consisting of link path information which is a link of URLs of the respective standard pages is stored in a database, and link path information stored in the database is stored from the target page. The gist of the present invention is to perform a rating on the target page for the link path information stored in the database to find out whether the target page matches a predetermined criterion, and to filter the target page based on the rating result.

According to the present invention of claim 9, hyperlink information consisting of link path information, which is a link of URLs of standard pages, is stored in a database, and the link path stored in the database from the target page. Information is searched for, whether or not the target page matches the predetermined criteria with respect to the link path information stored in the database, and the target page is filtered based on this rating result. If only the URL group of the page is designated, the degree of association between the designated URL group and the target page can be determined, and the target page can be filtered efficiently and accurately.

According to a tenth aspect of the present invention, in the invention according to the ninth aspect, the rating is performed based on the degree of association of the target page with each URL constituting the link path information stored in the database. Use as a summary.

Further, in the invention described in claim 11, in the invention described in claim 10, the degree of association reaches the target page by following a hyperlink from each URL constituting the link path information to the target page. The gist is to search whether there is a possible route, and the shorter the distance along this route, the greater the degree of association.

Further, in the invention of claim 12, in the invention of claim 10, the degree of association reaches the target page by following a hyperlink from each URL constituting the link path information to the target page. The gist is to search whether there is a possible route, and if there is a route, to search all reachable routes, and to find that the more routes there are, the higher the degree of association is.

The present invention according to claim 13 is a page rating / rating method for performing a rating as to how a certain target page is related to a preset standard, and filtering the target page based on the rating result. A computer-readable recording medium in which a filtering program is recorded, wherein hyperlink information including link path information, which is a link of URLs of each standard page, is stored in a database, and the target page is stored in the database. A page that searches the stored link path information and performs a rating as to whether the target page matches a predetermined criterion with respect to the link path information stored in the database, and filters the target page based on the rating result. Rating / And summarized in that to record the I filter ring program in a computer-readable recording medium.

According to the present invention of claim 13, hyperlink information consisting of link path information, which is a concatenation of URLs of standard pages, is stored in a database, and the link path stored in the database from the target page. A page rating / filtering program that retrieves information, performs a rating on whether or not a target page matches a predetermined criterion with respect to link path information stored in a database, and filters the target page based on the rating result. Since the data is recorded on the recording medium, the distribution property can be improved by using the recording medium.

Further, the present invention according to claim 14 is the invention according to claim 13, wherein each rating constitutes each U constituting the link path information stored in the database.
It is a gist to record a page rating / filtering program performed on the basis of the degree of association of the target page with the RL in a computer-readable recording medium.

Further, in the invention described in claim 15, in the invention described in claim 14, the degree of association reaches the target page by following a hyperlink from each URL constituting the link path information to the target page. The gist is to search whether there is a possible route, and record a page rating / filtering program that the degree of association is higher as the distance along the route is shorter in a computer-readable recording medium.

According to a sixteenth aspect of the present invention, in the invention according to the fourteenth aspect, a route through which the degree of association can reach the target page by following a hyperlink from each URL constituting the link path information to the target page If there is a route, search all reachable routes, and record the page rating / filtering program that the more the route is, the higher the degree of association is in a computer-readable recording medium. The point is to do.

[0038]

BEST MODE FOR CARRYING OUT THE INVENTION Embodiments of the present invention will be described below with reference to the drawings. FIG. 1 is a block diagram showing a configuration of a page rating / filtering apparatus according to an exemplary embodiment of the present invention. The page rating / filtering apparatus shown in the figure performs a rating as to how a certain target page is related to a preset standard, and performs a filtering on the target page based on the rating result. The device is a database unit (referred to as a DB unit) 101 that stores hyperlink information that is link path information that is a link of URLs of the respective standard pages, and the target page that is stored in the DB unit 101. A path search unit 102 for searching link path information,
A page score which constitutes a rating means for rating whether or not the target page matches the predetermined criteria with respect to the link path information stored in the DB unit 101 and a filtering means for filtering the target page based on the rating result. It is composed of a calculation unit 103 and an input / output unit 104 for inputting by a user and outputting a rating / filtering result.

The rating means is the DB section 101.
Based on the degree of relevance of the target page for each URL configuring the link path information stored in, the degree of relevance reaches the target page by following a hyperlink from each URL configuring the link path information to the target page. Search whether there is a possible route, and if the distance along this route is shorter, the degree of relevance is higher, and if there is a route that can reach the target page, then search all reachable routes and The higher the number, the higher the degree of association.

In this embodiment, there is an input Web
This is the URL of the page. Below, the page specified by the user is the target page, and the URL of that page is the target page URL
Say. In this embodiment, the output is the score of the target page and whether or not it matches the rule specified by the user. The score is the degree of association between a URL group designated in advance and the page. The rule describes whether or not the target page should be acquired, and is determined based on the degree of association.

Specifically, in this embodiment, the URL is set in advance.
A group is designated as the criterion, and whether to filter the target page is determined by calculating the degree of association of the target page with the pages included in the URL group.
The relevance calculation calculates whether there is a route that can be reached by following a hyperlink between the page included in the URL group and the target page, and if there is a route, searches all reachable routes. As the number of routes increases and the distance between routes decreases, the relationship is determined to be greater.

For example, when making a decision as to whether or not an employee should browse a WWW page, the UR of the page necessary for the work
Only the L group is designated as the criterion, and a rule is defined that the browsing is permitted only when the degree of association is equal to or higher than a threshold value designated in advance. And the target page and its UR
The degree of association with the L group is calculated, and the employee is allowed to browse the target page only when the degree of association is greater than or equal to a predetermined threshold value. The standard URL group need only be specified once, and need not be updated continuously.

That is, in the content distribution method of the present embodiment, the specified URL group is used by using the link path information from the target page to the linked page and the link path information from the page linked to the target page. By determining the degree of relevance between the target content and the target page, it is possible to determine whether the target content is permitted to browse without using word information as in the past, that is, without browsing the content. Become. Further, it is not necessary to browse the content in advance and make a judgment as in the conventional case.

The link path and link path referred to here are Web pages that can be reached by following hyperlinks, and are URL1 → URL2 → URL3 → ... →
A series of URLs such as URLm are continuous.
Specifically, the link path has a graph structure as shown in FIG. 4, where URL is a node, and each node connects arcs having directions (in this case, arcs are links),
Ark has HEAD at one end to identify the direction,
The other end is set as TAIL and is connected to a node, and each node can connect at most one HEAD and one TAIL.

Since the degree of association of the target page does not need to be calculated in advance, when it becomes necessary to calculate the degree of association of a new page, the link relationship between the page and the URL group is based on hyperlinks. Just calculate. As described above, in the score calculation method for the target page based on the hyperlink information, if a link is placed on page B in a certain page A, it is considered that the author of page A recommends page B. In many cases, the link will be to a page that is related to your page, so the ring information can be used to determine page relevance.

Next, the preparation for calculating the page score and the calculation process will be described. Here, a case will be described as an example in which it is determined whether the target page corresponds to an adult page in order to prohibit browsing of pages called adult pages and adult sites.

First, the preparation will be described. The URL designated by the user to calculate the degree of association with the target page is called a seed URL. A plurality of URLs can be designated as the seed URL. Further, the seed URL can be registered by dividing it into some kind of seed URL group. The seed URL specified by the user is the page score calculation unit 103.
Stored in.

In this embodiment, two seed URs are used.
Register the L group. These two groups are the blacklist group (hereinafter referred to as group 1 or G1) in which the URL of the adult site is registered,
URL of a non-adult site recommended for browsing
Is a registered whitelist group (hereinafter referred to as group 2 or G2). We belonging to each group
The URL of page b is registered based on the result determined by the registrant.

In the registration of hyperlink information, the hyperlink set from the WWW page (link source URL) on the Internet to the link destination URL is taken out and the information of the link is registered.

Information of link source URL: link destination URL for each hyperlink is registered in the link table of the DB unit 101. At the time of registration, duplicate registration is checked so that the already registered link information is not re-registered. That is, if the information of link source URL to be registered: link destination URL is already registered, it is not registered.

The link table is created in the preparation stage. This represents the state of the link on the Web page at a certain moment. If you create it in the preparation stage, it will be in a state where only the link information is cached, so you do not have to connect to the network many times to get the same information
By accessing B, necessary link information can be acquired. When a web page is acquired at the same time as the search, a certain UR
The search process stops there until a response is returned from the L Web server. To prevent this, a link table is prepared in advance. After caching,
When the page is updated, the link information of the Web and the link information of the DB are inconsistent, but the link information of the Web page that is frequently updated is considered to be less important than the fixed link that is not updated. Therefore, acquiring link information from a Web page at the time of path search is not considered here.

Registration of rules will be described. That is, the setting of a rule that describes whether or not the target page should be acquired based on the score based on the calculation result of the page score will be described.

The rule does not necessarily have to be set, and if not set, only the page score is output. This time, the rating is for prohibiting browsing of adult pages, so as a rule, (1) if the page score exceeds a certain fixed value, a rule to output "Page acquisition prohibited" and (2) page score If the value does not exceed a predetermined value, a rule to output "page acquisition permission" is set.

Next, the page score calculation processing will be described with reference to the flowchart shown in FIG.

When the user inputs a certain target page URL obj from the input / output unit 104 (step S201). The page score calculation unit 103 informs the path search unit 102 of URLo.
Pass bj and the URL group registered in the whitelist group G2. The path search unit 102 performs a path search process using the URL obj and the URL of G2 (step S20).
2) Pass the path search processing result to the page score calculation unit 103. The page score calculation unit 103 receives the result of the path search processing from the path search unit 102, and calculates the degree of association R (URLobj, G2) with the target page (step S20).
3).

Next, the degree of association R (URLobj, G1) between each of the URL groups registered in the blacklist group G1 and the target page is calculated (step S).
204, S205). That is, the path search unit 102
The path search processing is performed with the URL obj and the URL of G1 (step S204), and the page score calculation unit 103 receives the result of the path search processing, and the degree of association R (U
RLobj, G1) is calculated (step S205). Note that R (URLobj, G1) is the degree of association between the group 1 and the target page, and R (URLobj, G2) is group 2
And the degree of association between the target page.

Since this is an adult page determination, the page score of the target page URLobj is calculated by the following formula (step S206).

[0058]

[Equation 1] Page score (URLobj) = R (URLob
j, G1) -R (URLobj, G2) Here, the meaning of the page score will be described. R (UR
Lobj, G1) indicates that the larger the value, the deeper the relationship with the blacklist, and the greater the degree to which browsing should be prohibited. R (URLobj, G2) indicates that the larger the value, the closer the relationship with the white list is, and the larger the degree to which browsing is permitted. Therefore, the page score R (URLobj, G1) -R (URLobj, G
2) indicates that the larger the value, the more prohibited the browsing. That is, browsing is prohibited when the value exceeds the specified value.

This page score is the page score of the page of URLobj. Based on this score, "page acquisition prohibition or page acquisition permission" is determined according to the above rule. The score and the determination result according to the rule, that is, the rule application result are passed to the input / output unit 104, and the input / output unit 104 outputs the score and the determination result.

Next, two methods of calculating the degree of association will be described.

First, the calculation method 1 of the degree of association R (URLobj, Gi) will be described. Page score calculation unit 103
Calculates the degree of association R (URLobj, Gi) between the target page URLobj and the URL group Gi. Relevance R is U
It is calculated by the number of link paths connecting RLobb and each page in URLg1 and the distance of the link path. That is, it can be calculated by the following formula.

[0062]

## EQU00002 ## Relevance R (URLobj, Gi) = number of paths / total path distance The number of paths is the total number of paths of links connecting URLobj and each page in URLg1, and the distance of link paths is The calculation is performed depending on how many links are included in the link path connecting the URLobj and each page included in Gi, that is, how many other pages are included. For example, URLob
When one link is reached from j, the distance is 1, and when two links are reached, the distance is 2.

The number of paths and the total path distance required for calculating the degree of association are calculated as follows.

[0064]

[Equation 3] n indicates the number of specified URL groups, that is, the number of URLs included in the black list or the white list.

Next, the path search processing will be described with reference to the flowchart shown in FIG.

The degree of association R (URLobj, Gi) between the target page URLobj and the URL group Gi is calculated by the number of link paths connecting the URLobj and each page in the URLg1 and the distance of the link path. Therefore, for that purpose, a path search process is performed.

As a specific process of the number of paths and the path distance, for each URLim in Gi, all paths of links connecting URLobj and the URLim are searched.
The path search result is UR in the section as shown in FIG. 4, for example.
It is represented by a tree structure having L information. The root has URLobj as URL information.

In the path search process shown in FIG. 3, first, the root URLobj of the tree structure is set as a target point (step S30).
1). Then, the line "URL of link source = URL of attention point" is extracted from the link table of the DB unit 101, and the attention section, that is, the section indicating the URL serving as the base point of the current process is checked (step S302).

Next, a node is added to the tree structure by using the URL of the link destination of each line as a child node of the point of interest (step S30).
3). However, if there is no row in the DB unit 101 that matches the condition in the process of step S302, nothing is done. It is checked whether or not the layer of the added section has reached the search limit layer number (step S304), and the added contact is checked (step S305).

Next, it is checked whether or not there is an unchecked node in the same hierarchy as the point of interest (the number of nodes from the root to the point of interest), and if there is (step S306), 1 of them is checked.
To the next point of interest (step S307). And
Return to step S301 and repeat the same process,
If not, the process proceeds to step S308, and it is checked whether or not there is an unchecked clause in one more layer (step S308), and if there is one, the one of them is set as the point of interest (step S309). It returns to S301 and repeats the same processing. If there is no clause to be the point of interest, the search ends. The URL of the section from the root to the leaf whose URL is URLim is the path of the link connecting URLobj and its URLim.

The tree structure after the above search is shown in FIG. r
oute (URLobj, URLi) is the number of leaves whose URL is URLi in the tree structure after completion of the search. dist (Lij, URLi) is the URL of the leaf Lij
Is the number of layers of the leaf Lij. Leaf Lij
Is 0 if the URL is not URLi.

In some cases, the same home page may be reached from a plurality of routes. For example, if there is A → B → X to reach from A to X, it may be A → C → D → X. In such cases, count separately.

The degree of association represents the degree of association between two URLs, and the calculation is performed by designating between two URLs. Multiple URs
The degree of association between L and URL obj is calculated based on the degree of association between each URL included in a plurality of URLs and URL obj.

For example, in the case of the black list and URL obj, the degree of association between the two is calculated as follows.

(1) Assume that the total degree of association R_all = 0.
The total relevance is calculated for each URL and URLo in the blacklist.
The total value of the degree of association with bj is shown.

(2) Select one URL from the black list.

(3) The degree of association between the selected URL and URLobj is calculated and added to the total degree of association R_all.

(4) If there is a URL that has not been selected in the black list, return to (2). If not, proceed to the next (5).

(5) The total degree of association R_all is output as the degree of association between the blacklist and URLobj.

In the above-mentioned calculation method 1 of the degree of association, the degree of association between two URLs is searched for a link path connecting the URLs, and the more the number of link paths having a shorter distance and the greater the number of link paths, the more the degree of association becomes. Is calculated to be larger.

On the other hand, in the following method 2 of calculating the degree of association, only the shortest path is found. This corresponds to the case where the link path searched in the path search process, that is, the link path returned by the path search unit 102 is the shortest path between two URLs. However, the number of link paths is always 1.

In the calculation method 2 of the degree of association, a URL
Once the search is done, the URL will not be searched again. That is, in the calculation method 1, a plurality of paths including a certain same URL may be returned as a link path search result connecting two URLs, but the calculation method 2 does not have such a result.
In the calculation method 2, the target page URL obj is
And the degree of association R with URL group Gi (URLobj, Gi)
Can be performed at a high speed with a smaller calculation amount.

A method 2 of calculating the degree of association will be described.

First, initial processing is performed (step S1).
In this initial processing, the search list is set to ((URLobj,
0)). The search list is a set that holds URLs that need to be searched and has (URL name, number of layers) as an element. The initial value is a set having elements of the URL obj of the target page and the number of layers.

The searched URL list is empty.
The searched list holds URLs that have been searched.
It is a set whose elements are URLs. For example, (URL1, U
RL2, URL3).

Further, the search result list is empty. The search result list is a signal whose element is (URL name, number of layers) holding the result of reaching the target blacklist or whitelist. For example ((URLx, 5),
(URLy, 6)).

Next, the process of determining the URL of interest is performed as follows (step S2).

(1) From the search list, select one having a small number of layers. The search list is ((URLa, 3),
If (URLb, 4)), select (URLa, 3). If the search list is empty, nothing is selected and the search ends. The reason why the number of layers is small is to preferentially search a URL having a small path distance.

(2) The selected element is excluded from the search list. In the case of (1) above, the search list is ((URL
b, 4)).

(3) The URL of the selected element has been searched U
Add to RL list. In this example, URLa is added to the searched URL list.

(4) If the URL of the selected element exists in the black list or the white list, it is added to the search result list. In this example, (URLa, 3) is added.

Next, the process of adding the search space is performed as follows (step S3).

(1) If the number of layers of the URL selected in step S2 has reached a certain value, the process returns to step S2.
This is intended to terminate the search if the number of layers reaches a certain value.

(2) The following is performed for each of the URLs of pages linked to from the URL selected in step S2 (this is called an additional candidate URL).

It is checked whether the additional candidate URL exists in the searched URL list. If it exists, it means that the URL has already been investigated, so nothing is done. If it does not exist, it means an unsearched URL and is added to the search list. The number of layers increases by one. That is, (URL
If there is a link from a, 3) to URLc and URLc is added, (URLc, 4) is added to the search list.

Finally, the element in the search result list is the search result, and the element of the list is a combination of the URL and the number of layers.

The above-described conventional content designating method (URL designating method), that is, a method of filtering a page depending on whether it is included in the list or not can be considered as a special case of the present invention. In the “included in white list” state, the number of hops from the white list is 0. That is, in the path search process, this corresponds to when the search limit hierarchy number is 0,
This is the case when the RL itself matches the target page URL obj.

When the method of the present invention is used to determine whether or not to display the Internet content, the method of the present invention for filtering and rating between the terminal displaying the content and the server. The software that implements is operated, and the terminal accesses the server via the software. There are cases where the software is operated by the terminal device itself, and cases where hardware different from the server of the terminal is installed and the software is operated there, but any method may be used.

The URL of the DB unit 101 may have a very deep directory. For example, the directory below D1 is as follows. Up to jp / is the host part.

Http://www.hyp.jp/D1/D2/D3/content.html Normally, a URL is generally treated as a URL including a directory part. The problem with the method of the present invention is that the URL
As the number of times increases, the search space, that is, the amount of information of the tree structure in the path search processing and the amount of calculation of the path search processing explosively increase. Therefore, an approximate URL is used instead of the URL for the purpose of reducing the search space and the calculation amount. Here, the approximate URL is obtained by extracting from the leftmost head of the original URL to the nth "/" below the host name.
n is designated in advance. This is the same as extracting from the top of the URL to the nth layer of the directory. When n = 2, the approximate URL of the URL in the above example is as follows.

Http://www.hyp.jp/D1/D2/ Generally, for directories in a URL, the contents of the description are classified in more detail as the hierarchy increases, but in general, n = It is based on the hypothesis that if the URLs whose approximate URLs match with each other are about 2, the pages that are almost cohesive will be collected. For example, in one experiment, 1
When 28,000 unique links in 500 Web pages are retrieved, the URL is approximated
If (n = 1), the number of unique links becomes 3,500, and the number of databases can be reduced by 80% or more.

The processing procedure of the page rating / filtering method of the above embodiment is recorded as a program in a recording medium such as a CD or FD, and this recording medium is incorporated into a computer system or recorded in the recording medium. The program can be downloaded to a computer system via a communication line, or can be installed from a recording medium, and the computer system can be operated by the program to function as a page rating / filtering device that implements a page rating / filtering method. Of course, by using such a recording medium, it is possible to improve its distribution.

[0103]

As described above, according to the present invention,
The target page is searched for the standard link path information stored in the database, and the target page is rated for the link path information to determine whether or not the target page matches, and the target page is searched based on the rating result. Since the filtering is performed, if only the URL group of each standard page is designated, the degree of association between the designated URL group and the target page can be determined, and the target page can be filtered efficiently and appropriately.

[Brief description of drawings]

FIG. 1 is a block diagram showing a configuration of a page rating / filtering apparatus according to an exemplary embodiment of the present invention.

FIG. 2 is a flowchart showing a page score calculation process of a page score calculation unit used in the page rating / filtering device of the exemplary embodiment shown in FIG.

FIG. 3 is a flowchart showing a path search process of a path search unit used in the page rating / filtering apparatus of the embodiment shown in FIG.

4 is a diagram showing a tree structure formed after the path search processing of the embodiment shown in FIG.

[Explanation of symbols]

101 DB section 102 Path search unit 103 page score calculator 104 Input / output section

Continued front page    (72) Inventor Hiroshi Takeno             2-3-1, Otemachi, Chiyoda-ku, Tokyo             Inside Telegraph and Telephone Corporation (72) Inventor Hiroto Inagaki             2-3-1, Otemachi, Chiyoda-ku, Tokyo             Inside Telegraph and Telephone Corporation F-term (reference) 5B075 NK44 PR08

Claims (16)

[Claims] 1. A page rating / filtering method for performing a rating as to how a certain target page is related to a preset standard, and filtering the target page based on the rating result. Hyperlink information consisting of link path information, which is a concatenation of URLs of standard pages, is stored in a database, the link path information stored in the database is searched from the target page, and the target page is stored in the database. A page rating / filtering method, characterized in that the link path information thus obtained is rated to determine whether or not it meets a predetermined criterion, and the target page is filtered based on the rating result. 2. The page rating / filtering method according to claim 1, wherein the rating is performed based on a degree of association of a target page with each URL constituting the link path information stored in the database. 3. The degree of relevance is obtained by searching a hyperlink from each URL forming the link path information to a target page to see if there is a route that can reach the target page. The page rating / filtering method according to claim 2, wherein the shorter the relationship, the higher the degree of association. 4. The degree of relevance is obtained by following a hyperlink from each URL constituting the link path information to a target page, searching for a route to reach the target page, and if there is a route, 3. The page rating / filtering method according to claim 2, wherein all reachable routes are searched for, and the more routes there are, the higher the degree of association is. 5. A page rating / filtering device, which performs a rating as to how much a certain target page is related to a preset standard, and filters the target page based on the rating result. A database that stores hyperlink information that is link path information that is a link of URLs of standard pages, a path search unit that searches the link path information stored in the database from the target page, and the target page is a database Page rating, characterized in that it has rating means for rating whether or not the link path information stored in (1) meets a predetermined criterion, and filtering means for filtering the target page based on the rating result. Filtering apparatus. 6. The rating means calculates the degree of association of a target page with respect to each URL constituting the link path information stored in the database, and the means for performing rating based on the calculated degree of association. 6. The page rating / filtering device according to claim 5, further comprising: 7. The degree of relevance is obtained by tracing a hyperlink from each URL constituting the link path information to a target page, searching for a route to reach the target page, and finding a distance along the route. 7. The page rating / filtering device according to claim 6, wherein the shorter the relationship, the higher the degree of association. 8. The degree of relevance is obtained by following a hyperlink from each URL forming the link path information to a target page, searching for a route to reach the target page, and if there is a route, 7. The page rating / filtering device according to claim 6, wherein all reachable routes are searched, and the more routes there are, the higher the degree of association is. 9. A page rating / filtering program for rating how much a certain target page is related to a preset standard, and filtering the target page based on the rating result. Hyperlink information consisting of link path information, which is a concatenation of URLs of standard pages, is stored in a database, the link path information stored in the database is searched from the target page, and the target page is stored in the database. A page rating / filtering program, characterized in that the link path information thus obtained is rated to determine whether or not it meets a predetermined criterion, and the target page is filtered based on the rating result. 10. The page rating / filtering program according to claim 9, wherein the rating is performed based on a degree of association of a target page with each URL constituting the link path information stored in the database. 11. The degree of relevance is determined by searching a hyperlink from each URL constituting the link path information to a target page to see if there is a route that can reach the target page. 11. The page rating / filtering program according to claim 10, wherein the shorter the degree, the higher the degree of association. 12. The degree of relevance is obtained by following a hyperlink from each URL forming the link path information to a target page, searching for a route to reach the target page, and if there is a route, 11. The page rating / filtering program according to claim 10, wherein all reachable routes are searched, and the more routes there are, the higher the degree of association is. 13. A computer reading recording a page rating / filtering program for performing a rating as to how a certain target page is related to a preset standard and filtering the target page based on the rating result. It is a possible recording medium, and hyperlink information consisting of link path information which is a link of URLs of the respective standard pages is stored in a database, and the link path information stored in the database is stored from the target page. A page rating, characterized in that the target page is searched, the link path information stored in the database is rated, and whether the target page matches a predetermined criterion, and the target page is filtered based on the rating result. Phil Recorded computer-readable recording medium, the data ring program. 14. The page rating / filtering program according to claim 13, wherein the rating is performed based on a degree of association of a target page with each URL constituting link path information stored in a database. Computer-readable recording medium. 15. The degree of association is determined by searching a hyperlink from each URL forming the link path information to a target page to see if there is a route to reach the target page, and determining the distance along the route. The computer-readable recording medium recording the page rating / filtering program according to claim 14, wherein the shorter the relationship, the higher the degree of association. 16. The degree of relevance is obtained by tracing a hyperlink from each URL forming the link path information to a target page, searching for a route to reach the target page, and if there is a route, 15. The computer-readable recording medium storing the page rating / filtering program according to claim 14, wherein all reachable routes are searched, and the more routes there are, the higher the degree of association is.