Sciweavers

716 search results - page 97 / 144
» Mining Association Rules from Relational Data - Average Dist...
Sort
View
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 8 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
KDD
2009
ACM
152views Data Mining» more  KDD 2009»
14 years 8 months ago
A multi-relational approach to spatial classification
Spatial classification is the task of learning models to predict class labels based on the features of entities as well as the spatial relationships to other entities and their fe...
Richard Frank, Martin Ester, Arno Knobbe
ICDM
2005
IEEE
150views Data Mining» more  ICDM 2005»
14 years 1 months ago
Combining Multiple Clusterings by Soft Correspondence
Combining multiple clusterings arises in various important data mining scenarios. However, finding a consensus clustering from multiple clusterings is a challenging task because ...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
FLAIRS
2010
13 years 10 months ago
Handling of Numeric Ranges for Graph-Based Knowledge Discovery
Nowadays, graph-based knowledge discovery algorithms do not consider numeric attributes (they are discarded in the preprocessing step, or they are treated as alphanumeric values w...
Oscar E. Romero, Jesus A. Gonzalez, Lawrence B. Ho...
PKDD
2010
Springer
183views Data Mining» more  PKDD 2010»
13 years 6 months ago
Fast Active Exploration for Link-Based Preference Learning Using Gaussian Processes
Abstract. In preference learning, the algorithm observes pairwise relative judgments (preference) between items as training data for learning an ordering of all items. This is an i...
Zhao Xu, Kristian Kersting, Thorsten Joachims