Add to ORKGTo find similar web pages to a query page on the Web, this paper introduces a novel link-based similarity measure, called PageSim. Contrast to SimRank, a recursive refinement of cocitation, PageSim can measure similarity between any two web pages, whereas SimRank cannot in some cases. We give some intuitions to the PageSim model, and outline the model with mathematical definitions. Finally, we give an example to illustrate its effectiveness
In this paper we investigate the effect of using clustering algorithms in the reverse engineering fi...
Abstract. Web search algorithms that rank Web pages by examining the link structure of the Web are a...
In this paper, we use a Unified Relationship Matrix (URM) to represent a set of heterogeneous web ob...
Similarity calculation has many applications, such as information retrieval, and collaborative filte...
Similarity calculation has many applications, such as information retrieval, and collaborative filte...
To utilize the similarity information hidden in the Web graph, we investigate the problem of adaptiv...
This paper proposes a hyperlink-based web page similarity measurement and two matrix-based hierarchi...
Similarity search on the web aims to find web pages similar to a query page and return a ranked list...
Similarity search on the web aims to find web pages similar to a query page and return a ranked list...
The problem of nding similar pages to a given web page arises in many web applications such as searc...
In this paper we use a Unified Relationship Matrix (URM) to represent a set of heterogeneous data ob...
Many machine learning and data mining algorithms crucially rely on the similarity metrics. However, ...
To exploit the similarity information hidden in the hyper-link structure of the web, this paper intr...
The rapid increase of web complexity and size makes web searched results far from satisfaction in ma...
Many machine learning and data mining algorithms crucially rely on the similarity metrics. However, ...
In this paper we investigate the effect of using clustering algorithms in the reverse engineering fi...
Abstract. Web search algorithms that rank Web pages by examining the link structure of the Web are a...
In this paper, we use a Unified Relationship Matrix (URM) to represent a set of heterogeneous web ob...
Similarity calculation has many applications, such as information retrieval, and collaborative filte...
Similarity calculation has many applications, such as information retrieval, and collaborative filte...
To utilize the similarity information hidden in the Web graph, we investigate the problem of adaptiv...
This paper proposes a hyperlink-based web page similarity measurement and two matrix-based hierarchi...
Similarity search on the web aims to find web pages similar to a query page and return a ranked list...
Similarity search on the web aims to find web pages similar to a query page and return a ranked list...
The problem of nding similar pages to a given web page arises in many web applications such as searc...
In this paper we use a Unified Relationship Matrix (URM) to represent a set of heterogeneous data ob...
Many machine learning and data mining algorithms crucially rely on the similarity metrics. However, ...
To exploit the similarity information hidden in the hyper-link structure of the web, this paper intr...
The rapid increase of web complexity and size makes web searched results far from satisfaction in ma...
Many machine learning and data mining algorithms crucially rely on the similarity metrics. However, ...
In this paper we investigate the effect of using clustering algorithms in the reverse engineering fi...
Abstract. Web search algorithms that rank Web pages by examining the link structure of the Web are a...
In this paper, we use a Unified Relationship Matrix (URM) to represent a set of heterogeneous web ob...