Sciweavers

1913 search results - page 247 / 383
» Using Data Mining in MURA Graphic Problems
Sort
View
JMMA
2010
162views more  JMMA 2010»
14 years 11 months ago
Co-clustering Documents and Words by Minimizing the Normalized Cut Objective Function
This paper follows a word-document co-clustering model independently introduced in 2001 by several authors such as I.S. Dhillon, H. Zha and C. Ding. This model consists in creatin...
Charles-Edmond Bichot
COLT
2010
Springer
15 years 2 months ago
Forest Density Estimation
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
Anupam Gupta, John D. Lafferty, Han Liu, Larry A. ...
KDD
2005
ACM
158views Data Mining» more  KDD 2005»
16 years 4 months ago
Adversarial learning
Many classification tasks, such as spam filtering, intrusion detection, and terrorism detection, are complicated by an adversary who wishes to avoid detection. Previous work on ad...
Daniel Lowd, Christopher Meek
WSDM
2010
ACM
254views Data Mining» more  WSDM 2010»
16 years 1 months ago
Learning Influence Probabilities In Social Networks
Recently, there has been tremendous interest in the phenomenon of influence propagation in social networks. The studies in this area assume they have as input to their problems a ...
Amit Goyal 0002, Francesco Bonchi, Laks V. S. Laks...
OTM
2007
Springer
15 years 10 months ago
Discovering Executable Semantic Mappings Between Ontologies
Creating executable semantic mappings is an important task for ontology-based information integration. Although it is argued that mapping tools may require interaction from humans ...
Han Qin, Dejing Dou, Paea LePendu