Sciweavers

1215 search results - page 143 / 243
» Numbers in Multi-relational Data Mining
Sort
View
ICDM
2007
IEEE
182views Data Mining» more  ICDM 2007»
15 years 11 months ago
Co-ranking Authors and Documents in a Heterogeneous Network
The problem of evaluating scientific publications and their authors is important, and as such has attracted increasing attention. Recent graph-theoretic ranking approaches have d...
Ding Zhou, Sergey A. Orshanskiy, Hongyuan Zha, C. ...
ICDM
2010
IEEE
216views Data Mining» more  ICDM 2010»
15 years 3 months ago
K-AP: Generating Specified K Clusters by Efficient Affinity Propagation
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...
Xiangliang Zhang, Wei Wang, Kjetil Nørv&ari...
DMIN
2006
126views Data Mining» more  DMIN 2006»
15 years 6 months ago
An Algorithm for the Discovery of Arbitrary Length Ordinal Association Rules
Association rule mining techniques are used to search attribute-value pairs that occur frequently together in a data set. Ordinal association rules are a particular type of associa...
Alina Campan, Gabriela Serban, Traian Marius Truta...
DMIN
2006
151views Data Mining» more  DMIN 2006»
15 years 6 months ago
Rough Set Theory: Approach for Similarity Measure in Cluster Analysis
- Clustering of data is an important data mining application. One of the problems with traditional partitioning clustering methods is that they partition the data into hard bound n...
Shuchita Upadhyaya, Alka Arora, Rajni Jain
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
16 years 2 months ago
Parallel Pairwise Clustering.
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
Elad Yom-Tov, Noam Slonim