Sciweavers

1711 search results - page 169 / 343
» Link Based Clustering of Web Search Results
Sort
View
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
16 years 1 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
CIKM
2009
Springer
16 years 1 months ago
StereoTrust: a group based personalized trust model
Trust plays important roles in diverse decentralized environments, including our society at large. Computational trust models help to, for instance, guide users’ judgements in o...
Xin Liu, Anwitaman Datta, Krzysztof Rzadca, Ee-Pen...
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
16 years 7 months ago
CLICKS: an effective algorithm for mining subspace clusters in categorical datasets
We present a novel algorithm called Clicks, that finds clusters in categorical datasets based on a search for k-partite maximal cliques. Unlike previous methods, Clicks mines subs...
Mohammed Javeed Zaki, Markus Peters, Ira Assent, T...
ICWE
2010
Springer
15 years 8 months ago
Designing Service Marts for Engineering Search Computing Applications
: The use of patterns in data management is not new: in data warehousing, data marts are simple conceptual schemas with exactly one core entity, describing facts, surrounded by mul...
Alessandro Campi, Stefano Ceri, Andrea Maesani, St...
ZUM
2005
Springer
136views Formal Methods» more  ZUM 2005»
16 years 8 hour ago
Some Guidelines for Formal Development of Web-Based Applications in B-Method
Abstract. Web-based applications are the most common form of distributed systems that have gained a lot of attention in the past ten years. Today many of us are relying on scores o...
Abdolbaghi Rezazadeh, Michael J. Butler