Method for organizing records of database search activity by topical relevance

MH Hansen, EA Shriver - US Patent 7,194,454, 2007 - Google Patents
The invention is related to the art of data search. It is described in reference to World Wide
Web and Internet searching. However, those of ordinary skill in the art will understand that …

Web communities: models and algorithms

G Greco, S Greco, E Zumpano - World Wide Web, 2004 - Springer
In the last few years, a lot of research has been devoted to developing new techniques for
improving the recall and the precision of current web search engines. Few works deal with …

Analysis of user relations and reading activity in weblogs

T Furukawa, T Matsuzawa, Y Matsuo… - … in Japan (Part I …, 2006 - Wiley Online Library
The relationships among weblogs (“blogs”) can be recognized through bookmarks (favorite
blogs linked to from the user's own blog page), comments, and trackbacks. Such …

[PDF][PDF] Finding Related Web Pages Based on Connectivity Information from a Search Engine.

T Murata - WWW Posters, 2001 - ambuehler.ethz.ch
This paper proposes a method for finding related Web pages based on connectivity
information of hyperlinks. As claimed by Kumar, a complete bipartite graph of Web pages …

Extraction of a latent blog community based on subject

SH Yoon, JH Shin, SW Kim, S Park - … of the 18th ACM conference on …, 2009 - dl.acm.org
In the blogosphere, there exist posts relevant to a particular subject and blogs that show
interests in the subject. In this paper, we define a set of such posts and blogs as" blog …

Mobile web searching

KG August, MH Hansen… - Bell Labs Technical …, 2001 - Wiley Online Library
Searching the Web on a mobile device such as a cell phone poses unique problems for the
user that cannot be easily overcome through the interface. Given the restricted display of …

[图书][B] Advances in mining graphs, trees and sequences

T Washio, JN Kok, L de Raedt - 2005 - books.google.com
Ever since the early days of machine learning and data mining, it has been realized that the
traditional attribute-value and item-set representations are too limited for many practical …

The complexity of detecting fixed-density clusters

K Holzapfel, S Kosub, MG Maaß, H Täubig - Italian Conference on …, 2003 - Springer
We study the complexity of finding a subgraph of a certain size and a certain density, where
density is measured by the average degree. Let γ: ℕ→ ℚ+ be any density function, ie, γ is …

Applying site information to information retrieval from the Web

Y Asano, H Imai, M Toyoda… - Proceedings of the …, 2002 - ieeexplore.ieee.org
In recent years, several information retrieval methods using information about Web-links
have been developed, such as HITS and trawling. In order to analyze Web-links dividing into …

[HTML][HTML] The complexity of detecting fixed-density clusters

K Holzapfel, S Kosub, MG Maaß, H Täubig - Discrete Applied Mathematics, 2006 - Elsevier
We study the complexity of finding a subgraph of a certain size and a certain density, where
density is measured by the average degree. Let γ: N→ Q+ be any density function, ie, γ is …