Sciweavers

3604 search results - page 485 / 721
» Relation rule mining
Sort
View
SDM
2007
SIAM
112views Data Mining» more  SDM 2007»
15 years 8 months ago
PoClustering: Lossless Clustering of Dissimilarity Data
Given a set of objects V with a dissimilarity measure between pairs of objects in V , a PoCluster is a collection of sets P ⊂ powerset(V ) partially ordered by the ⊂ relation ...
Jinze Liu, Qi Zhang, Wei Wang 0010, Leonard McMill...
MSV
2004
15 years 8 months ago
MABAC - Matrix Based Clustering Algorithm
Clustering is a prominent method in the data mining field. It is a discovery process that groups data such that intra cluster similarity is maximized and the inter cluster similar...
Yonghui Chen, Alan P. Sprague, Kevin D. Reilly
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
15 years 8 months ago
Finding Frequent Patterns in a Large Sparse Graph
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
Michihiro Kuramochi, George Karypis
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
15 years 8 months ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth
IS
2007
15 years 6 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis