Sciweavers

1861 search results - page 249 / 373
» Pattern Databases
Sort
View
WWW
2004
ACM
16 years 3 months ago
Similarity spreading: a unified framework for similarity calculation of interrelated objects
In many Web search applications, similarities between objects of one type (say, queries) can be affected by the similarities between their interrelated objects of another type (sa...
Gui-Rong Xue, Hua-Jun Zeng, Zheng Chen, Wei-Ying M...
KDD
2002
ACM
109views Data Mining» more  KDD 2002»
16 years 3 months ago
Topics in 0--1 data
Large 0-1 datasets arise in various applications, such as market basket analysis and information retrieval. We concentrate on the study of topic models, aiming at results which in...
Ella Bingham, Heikki Mannila, Jouni K. Seppän...
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
15 years 8 months ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han
KDD
2010
ACM
326views Data Mining» more  KDD 2010»
15 years 29 days ago
Document clustering via dirichlet process mixture model with feature selection
One essential issue of document clustering is to estimate the appropriate number of clusters for a document collection to which documents should be partitioned. In this paper, we ...
Guan Yu, Ruizhang Huang, Zhaojun Wang
PKDD
2009
Springer
95views Data Mining» more  PKDD 2009»
15 years 9 months ago
Non-redundant Subgroup Discovery Using a Closure System
Subgroup discovery is a local pattern discovery task, in which descriptions of subpopulations of a database are evaluated against some quality function. As standard quality functio...
Mario Boley, Henrik Grosskreutz