Sciweavers

2497 search results - page 133 / 500
» A Partial-Repeatability Approach to Data Mining
Sort
View
KDD
2012
ACM
164views Data Mining» more  KDD 2012»
13 years 12 days ago
SeqiBloc: mining multi-time spanning blockmodels in dynamic graphs
Blockmodelling is an important technique for decomposing graphs into sets of roles. Vertices playing the same role have similar patterns of interactions with vertices in other rol...
Jeffrey Chan, Wei Liu, Christopher Leckie, James B...
GIS
2005
ACM
15 years 11 months ago
Extracting spatial association rules from spatial transactions
Georeferenced information is growing every day, and geographical information systems are becoming crucial in many decision processes. As a consequence, extracting knowledge from G...
Salvatore Rinzivillo, Franco Turini
ICDM
2008
IEEE
122views Data Mining» more  ICDM 2008»
15 years 4 months ago
Nonnegative Matrix Factorization for Combinatorial Optimization: Spectral Clustering, Graph Matching, and Clique Finding
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
Chris H. Q. Ding, Tao Li, Michael I. Jordan
ICDM
2007
IEEE
196views Data Mining» more  ICDM 2007»
15 years 4 months ago
Diagnosing Similarity of Oscillation Trends in Time Series
Sensor networks have increased the amount and variety of temporal data available, requiring the definition of new techniques for data mining. Related research typically addresses...
Leonardo E. Mariote, Claudia Bauzer Medeiros, Rica...
ISMIS
2005
Springer
15 years 3 months ago
Bitmap Index-Based Decision Trees
In this paper we propose an original approach to apply data mining algorithms, namely decision tree-based methods, taking into account not only the size of processed databases but ...
Cécile Favre, Fadila Bentayeb