Sciweavers

362 search results - page 72 / 73
» Probabilistic workflow mining
Sort
View
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 8 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
SAC
2009
ACM
14 years 2 months ago
Applying latent dirichlet allocation to group discovery in large graphs
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
Keith Henderson, Tina Eliassi-Rad
PKDD
2004
Springer
205views Data Mining» more  PKDD 2004»
14 years 21 days ago
Breaking Through the Syntax Barrier: Searching with Entities and Relations
The next wave in search technology will be driven by the identification, extraction, and exploitation of real-world entities represented in unstructured textual sources. Search sy...
Soumen Chakrabarti
CIKM
2008
Springer
13 years 9 months ago
A consensus based approach to constrained clustering of software requirements
Managing large-scale software projects involves a number of activities such as viewpoint extraction, feature detection, and requirements management, all of which require a human a...
Chuan Duan, Jane Cleland-Huang, Bamshad Mobasher
EMNLP
2008
13 years 8 months ago
Modeling Annotators: A Generative Approach to Learning from Annotator Rationales
A human annotator can provide hints to a machine learner by highlighting contextual "rationales" for each of his or her annotations (Zaidan et al., 2007). How can one ex...
Omar Zaidan, Jason Eisner