Sciweavers

117 search results - page 23 / 24
» What do we know about the Metropolis algorithm
Sort
View
ICDM
2006
IEEE
76views Data Mining» more  ICDM 2006»
14 years 1 months ago
How Bayesians Debug
Manual debugging is expensive. And the high cost has motivated extensive research on automated fault localization in both software engineering and data mining communities. Fault l...
Chao Liu 0001, Zeng Lian, Jiawei Han
WSDM
2009
ACM
115views Data Mining» more  WSDM 2009»
14 years 2 months ago
Discovering and using groups to improve personalized search
Personalized Web search takes advantage of information about an individual to identify the most relevant results for that person. A challenge for personalization lies in collectin...
Jaime Teevan, Meredith Ringel Morris, Steve Bush
SDM
2009
SIAM
138views Data Mining» more  SDM 2009»
14 years 4 months ago
ShatterPlots: Fast Tools for Mining Large Graphs.
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
Ana Paula Appel, Andrew Tomkins, Christos Faloutso...
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
14 years 2 months ago
Spatio-temporal Multi-dimensional Relational Framework Trees
—The real world is composed of sets of objects that move and morph in both space and time. Useful concepts can be defined in terms of the complex interactions between the multi-...
Matthew Bodenhamer, Samuel Bleckley, Daniel Fennel...
WWW
2008
ACM
14 years 8 months ago
A differential notion of place for local search
For extracting the characteristics a specific geographic entity, and notably a place, we propose to use dynamic Extreme Tagging Systems in combination with the classic approach of...
Vlad Tanasescu, John Domingue