Sciweavers

4009 search results - page 489 / 802
» Clustering on Complex Graphs
Sort
View
ASUNAM
2011
IEEE
14 years 6 months ago
Probabilistic Subgraph Matching on Huge Social Networks
—Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the dat...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...
ICIP
2006
IEEE
16 years 8 months ago
Spatial and Color Spaces Combination for Natural Scene Text Extraction
Natural scene images brought new challenges for a few years and one of them is text understanding over images or videos. Text extraction which consists to segment textual foregrou...
Bernard Gosselin, Céline Mancas-Thillou
315
Voted
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
16 years 8 months ago
A General Framework for Fast Co-clustering on Large Datasets Using Matrix Decomposition
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
Feng Pan, Xiang Zhang, Wei Wang 0010
ICDM
2008
IEEE
155views Data Mining» more  ICDM 2008»
16 years 1 months ago
Organic Pie Charts
We present a new visualization of the distance and cluster structure of high dimensional data. It is particularly well suited for analysis tasks of users unfamiliar with complex d...
Fabian Mörchen
IDA
2007
Springer
16 years 25 days ago
Compact and Understandable Descriptions of Mixtures of Bernoulli Distributions
Abstract. Finite mixture models can be used in estimating complex, unknown probability distributions and also in clustering data. The parameters of the models form a complex repres...
Jaakko Hollmén, Jarkko Tikka