Sciweavers

4972 search results - page 251 / 995
» Ranking on graph data
Sort
View
ESA
1999
Springer
95views Algorithms» more  ESA 1999»
15 years 11 months ago
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
Xin He, Ming-Yang Kao, Hsueh-I Lu
SG
2005
Springer
16 years 5 days ago
Picturing Causality - The Serendipitous Semiotics of Causal Graphs
Abstract. Bayesian nets (BNs) appeared in the 1980s as a solution to computational and representational problems encountered in knowledge representation of uncertain information. S...
Eric Neufeld, Sonje Kristtorn
152
Voted
WWW
2009
ACM
16 years 7 months ago
Estimating the impressionrank of web pages
The ImpressionRank of a web page (or, more generally, of a web site) is the number of times users viewed the page while browsing search results. ImpressionRank captures the visibi...
Ziv Bar-Yossef, Maxim Gurevich
KDD
2004
ACM
146views Data Mining» more  KDD 2004»
16 years 7 months ago
Using Hyperlink Features to Personalize Web Search
Personalized search has gained great popularity to improve search effectiveness in recent years. The objective of personalized search is to provide users with information tailored ...
Mehmet S. Aktas, Mehmet A. Nacar, Filippo Menczer
PKDD
1999
Springer
106views Data Mining» more  PKDD 1999»
15 years 11 months ago
Heuristic Measures of Interestingness
When mining a large database, the number of patterns discovered can easily exceed the capabilities of a human user to identify interesting results. To address this problem, variou...
Robert J. Hilderman, Howard J. Hamilton