Sciweavers

587 search results - page 21 / 118
» Clustering Improves the Exploration of Graph Mining Results
Sort
View
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
16 years 4 days ago
Fast discovery of connection subgraphs
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
Christos Faloutsos, Kevin S. McCurley, Andrew Tomk...
ICDM
2002
IEEE
162views Data Mining» more  ICDM 2002»
15 years 4 months ago
Phrase-based Document Similarity Based on an Index Graph Model
Document clustering techniques mostly rely on single term analysis of the document data set, such as the Vector Space Model. To better capture the structure of documents, the unde...
Khaled M. Hammouda, Mohamed S. Kamel
KAIS
2006
164views more  KAIS 2006»
14 years 11 months ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
15 years 6 months ago
Recommendation via Query Centered Random Walk on K-Partite Graph
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...
Haibin Cheng, Pang-Ning Tan, Jon Sticklen, William...
JDCTA
2010
134views more  JDCTA 2010»
14 years 6 months ago
A New Clustering Segmentation Algorithm of 3D Medical Data Field Based on Data Mining
Direct 3D volume segmentation is one of the difficult and hot research fields in 3D medical data field processing. Using the clustering and analyzing techniques of data mining, a ...
Li Xinwu