Sciweavers

1836 search results - page 157 / 368
» Mining Clustering Dimensions
Sort
View
IPPS
2008
IEEE
15 years 8 months ago
Parallel mining of closed quasi-cliques
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
Yuzhou Zhang, Jianyong Wang, Zhiping Zeng, Lizhu Z...
ICMCS
2006
IEEE
344views Multimedia» more  ICMCS 2006»
15 years 8 months ago
Pattern Mining in Visual Concept Streams
Pattern mining algorithms are often much easier applied than quantitatively assessed. In this paper we address the pattern evaluation problem by looking at both the capability of ...
Lexing Xie, Shih-Fu Chang
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
15 years 7 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
PVLDB
2010
135views more  PVLDB 2010»
15 years 10 days ago
Similarity Search and Mining in Uncertain Databases
Managing, searching and mining uncertain data has achieved much attention in the database community recently due to new sensor technologies and new ways of collecting data. There ...
Matthias Renz, Reynold Cheng, Hans-Peter Kriegel, ...
DMIN
2009
180views Data Mining» more  DMIN 2009»
14 years 11 months ago
APHID: A Practical Architecture for High-Performance, Privacy-Preserving Data Mining
While the emerging field of privacy preserving data mining (PPDM) will enable many new data mining applications, it suffers from several practical difficulties. PPDM algorithms are...
Jimmy Secretan, Anna Koufakou, Michael Georgiopoul...