Sciweavers

489 search results - page 1 / 98
» A Method for Accelerating the HITS Algorithm
Sort
View
JACIII
2010
84views more  JACIII 2010»
13 years 3 months ago
A Method for Accelerating the HITS Algorithm
Andri Mirzal, Masashi Furukawa
WAIM
2007
Springer
13 years 11 months ago
Improvements of HITS Algorithms for Spam Links
The HITS algorithm proposed by Kleinberg is one of the representative methods of scoring Web pages by using hyperlinks. In the days when the algorithm was proposed, most of the pag...
Yasuhito Asano, Yu Tezuka, Takao Nishizeki
KDD
2009
ACM
228views Data Mining» more  KDD 2009»
14 years 5 months ago
A generalized Co-HITS algorithm and its application to bipartite graphs
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
Hongbo Deng, Michael R. Lyu, Irwin King
AAAI
2008
13 years 7 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
BMCBI
2004
91views more  BMCBI 2004»
13 years 4 months ago
Improved hit criteria for DNA local alignment
The hit criterion is a key component of heuristic local alignment algorithms. It specifies a class of patterns assumed to witness a potential similarity, and this choice is decisi...
Laurent Noé, Gregory Kucherov