Sciweavers

4009 search results - page 172 / 802
» Clustering on Complex Graphs
Sort
View
134
Voted
JDCTA
2010
122views more  JDCTA 2010»
14 years 10 months ago
The Application Research of High-dimensional Mixed-attribute Data Clustering Algorithm
High-dimensional mixed-attribute data clustering has become an important research direction in data mining area. Because of the advantages of the information technology, data coll...
Lilin Fan, Chunhong Liu, Qian Liu
132
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Outlier-aware robust clustering
Clustering is a basic task in a variety of machine learning applications. Partitioning a set of input vectors into compact, wellseparated subsets can be severely affected by the p...
Pedro A. Forero, Vassilis Kekatos, Georgios B. Gia...
WAIM
2010
Springer
15 years 2 months ago
HyperGraphDB: A Generalized Graph Database
We present HyperGraphDB, a novel graph database based on generalized hypergraphs where hyperedges can contain other hyperedges. This generalization automatically reifies every ent...
Borislav Iordanov
DAM
2002
82views more  DAM 2002»
15 years 3 months ago
On the computational complexity of strong edge coloring
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
Mohammad Mahdian
SPAA
2010
ACM
15 years 2 months ago
Managing the complexity of lookahead for LU factorization with pivoting
We describe parallel implementations of LU factorization with pivoting for multicore architectures. Implementations that differ in two different dimensions are discussed: (1) usin...
Ernie Chan, Robert A. van de Geijn, Andrew Chapman