Sciweavers

2137 search results - page 119 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
COLING
2008
14 years 7 days ago
A Framework for Identifying Textual Redundancy
The task of identifying redundant information in documents that are generated from multiple sources provides a significant challenge for summarization and QA systems. Traditional ...
Kapil Thadani, Kathleen McKeown
KDD
2008
ACM
257views Data Mining» more  KDD 2008»
14 years 11 months ago
Knowledge discovery of semantic relationships between words using nonparametric bayesian graph model
We developed a model based on nonparametric Bayesian modeling for automatic discovery of semantic relationships between words taken from a corpus. It is aimed at discovering seman...
Issei Sato, Minoru Yoshida, Hiroshi Nakagawa
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 11 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
CEC
2005
IEEE
14 years 4 months ago
A parallel Monte Carlo simulation on cluster systems for financial derivatives pricing
In recent years the complexity of numerical computations in computational financial applications has been increased enormously. Monte Carlo algorithm is one of main tools in comput...
Jin Suk Kim, Suk Joon Byun
SIGMOD
2011
ACM
269views Database» more  SIGMOD 2011»
13 years 1 months ago
Advancing data clustering via projective clustering ensembles
Projective Clustering Ensembles (PCE) are a very recent advance in data clustering research which combines the two powerful tools of clustering ensembles and projective clustering...
Francesco Gullo, Carlotta Domeniconi, Andrea Tagar...