Sciweavers

292 search results - page 2 / 59
» A Partition-Based Approach to Graph Mining
Sort
View
DCC
2008
IEEE
14 years 4 months ago
An Approach to Graph and Netlist Compression
We introduce an EDIF netlist graph algorithm which is lossy with respect to the original byte stream but lossless in terms of the circuit information it contains based on a graph ...
Jeehong Yang, Serap A. Savari, Oskar Mencer
ADC
2006
Springer
169views Database» more  ADC 2006»
13 years 11 months ago
A further study in the data partitioning approach for frequent itemsets mining
Frequent itemsets mining is well explored for various data types, and its computational complexity is well understood. Based on our previous work by Nguyen and Orlowska (2005), th...
Son N. Nguyen, Maria E. Orlowska
ICDE
2009
IEEE
290views Database» more  ICDE 2009»
14 years 6 months ago
GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases
Graphs are being increasingly used to model a wide range of scientific data. Such widespread usage of graphs has generated considerable interest in mining patterns from graph datab...
Sayan Ranu, Ambuj K. Singh
KDD
1999
ACM
115views Data Mining» more  KDD 1999»
13 years 9 months ago
Horting Hatches an Egg: A New Graph-Theoretic Approach to Collaborative Filtering
Charu C. Aggarwal, Joel L. Wolf, Kun-Lung Wu, Phil...
NAACL
2007
13 years 6 months ago
OMS-J: An Opinion Mining System for Japanese Weblog Reviews Using a Combination of Supervised and Unsupervised Approaches
We introduce a simple opinion mining system for analyzing Japanese Weblog reviews called OMS-J. OMS-J is designed to provide an intuitive visual GUI of opinion mining graphs for a...
Guangwei Wang, Kenji Araki