Sciweavers

421 search results - page 4 / 85
» A probabilistic framework for relational clustering
Sort
View
WWW
2006
ACM
16 years 8 days ago
Mining clickthrough data for collaborative web search
This paper is to investigate the group behavior patterns of search activities based on Web search history data, i.e., clickthrough data, to boost search performance. We propose a ...
Jian-Tao Sun, Xuanhui Wang, Dou Shen, Hua-Jun Zeng...
SNPD
2010
15 years 1 months ago
Explaining Classification by Finding Response-Related Subgroups in Data
Abstract--A method for explaining results of a regressionbased classifier is proposed. The data is clustered using a metric extracted from the classifier. This way, clusters found ...
Elina Parviainen, Aki Vehtari
ENTCS
2008
89views more  ENTCS 2008»
14 years 11 months ago
Relational Analysis and Precision via Probabilistic Abstract Interpretation
istic Abstract Interpretation Alessandra Di Pierro1 Pascal Sotin2 Herbert Wiklicky3 Within the context of a quantitative generalisation of the well established framework of Abstra...
Alessandra Di Pierro, Pascal Sotin, Herbert Wiklic...
ICPR
2002
IEEE
16 years 21 days ago
Probabilistic Models for Generating, Modelling and Matching Image Categories
In this paper we present a probabilistic and continuous framework for supervised image category modelling and matching as well as unsupervised clustering of image space into image...
Hayit Greenspan, Shiri Gordon, Jacob Goldberger
EWSN
2007
Springer
15 years 11 months ago
An Energy-Efficient K-Hop Clustering Framework for Wireless Sensor Networks
Many applications in wireless sensor networks (WSNs) benefit significantly from organizing nodes into groups, called clusters, because data aggregation and data filtering applied i...
Quanbin Chen, Jian Ma, Yanmin Zhu, Dian Zhang, Lio...