Sciweavers

176 search results - page 26 / 36
» Crime Data Mining: A General Framework and Some Examples
Sort
View
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
14 years 7 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
SIGMOD
2008
ACM
157views Database» more  SIGMOD 2008»
14 years 7 months ago
CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
Feng Pan, Xiang Zhang, Wei Wang 0010
TPHOL
2009
IEEE
14 years 2 months ago
A Formalisation of Smallfoot in HOL
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
Thomas Tuerk
KDD
2009
ACM
194views Data Mining» more  KDD 2009»
14 years 8 months ago
Combining link and content for community detection: a discriminative approach
In this paper, we consider the problem of combining link and content analysis for community detection from networked data, such as paper citation networks and Word Wide Web. Most ...
Tianbao Yang, Rong Jin, Yun Chi, Shenghuo Zhu
KDD
2008
ACM
184views Data Mining» more  KDD 2008»
14 years 7 months ago
Joint latent topic models for text and citations
In this work, we address the problem of joint modeling of text and citations in the topic modeling framework. We present two different models called the Pairwise-Link-LDA and the ...
Ramesh Nallapati, Amr Ahmed, Eric P. Xing, William...