Sciweavers

2782 search results - page 547 / 557
» Pattern Recognition
Sort
View
EDBT
2011
ACM
197views Database» more  EDBT 2011»
14 years 3 months ago
Symmetrizations for clustering directed graphs
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...
Venu Satuluri, Srinivasan Parthasarathy
EDBT
2011
ACM
199views Database» more  EDBT 2011»
14 years 3 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...
FOSSACS
2011
Springer
14 years 3 months ago
Minimizing Deterministic Lattice Automata
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
Shulamit Halamish, Orna Kupferman
SIGMOD
2011
ACM
269views Database» more  SIGMOD 2011»
14 years 2 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...
103
Voted
CIKM
2011
Springer
13 years 11 months ago
Towards feature selection in network
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
Quanquan Gu, Jiawei Han