Sciweavers

292 search results - page 43 / 59
» A Partition-Based Approach to Graph Mining
Sort
View
ICDM
2008
IEEE
108views Data Mining» more  ICDM 2008»
14 years 1 months ago
Non-negative Matrix Factorization on Manifold
Recently Non-negative Matrix Factorization (NMF) has received a lot of attentions in information retrieval, computer vision and pattern recognition. NMF aims to find two non-nega...
Deng Cai, Xiaofei He, Xiaoyun Wu, Jiawei Han
IS
2007
13 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
SDM
2009
SIAM
160views Data Mining» more  SDM 2009»
14 years 3 months ago
Discovering Substantial Distinctions among Incremental Bi-Clusters.
A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets which seeks to find s...
Faris Alqadah, Raj Bhatnagar
CIKM
2007
Springer
14 years 27 days ago
Top-k subgraph matching query in a large graph
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...
Lei Zou, Lei Chen 0002, Yansheng Lu
ICDM
2009
IEEE
98views Data Mining» more  ICDM 2009»
14 years 1 months ago
Topic Distributions over Links on Web
—It is well known that Web users create links with different intentions. However, a key question, which is not well studied, is how to categorize the links and how to quantify th...
Jie Tang, Jing Zhang, Jeffrey Xu Yu, Zi Yang, Keke...