421 search results - page 29 / 85 » A probabilistic framework for relational clustering |
135
click to vote
UAI
1997
15 years 3 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
104
click to vote
TAL
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We define Probabilistic Constrained W-grammars (PCWgrammars), a two-level formalism capable of capturing grammatical frameworks used in two state of the art parsers, nam...
133
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or treatment of relatio...
109
click to vote
ITNG
2010
IEEE
15 years 7 months ago
2010
IEEE
— Clustering is a pivotal building block in many data mining applications and in machine learning in general. Most clustering algorithms in the literature pertain to off-line (or...
134
click to vote
WISE
2005
Springer
15 years 7 months ago
2005
Springer
Web transaction data between Web visitors and Web functionalities usually convey user task-oriented behavior pattern. Mining such type of clickstream data will lead to capture usag...