Sciweavers

30 search results - page 4 / 6
» Finding Maximal Fully-Correlated Itemsets in Large Databases
Sort
View
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 11 days ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
LWA
2004
13 years 9 months ago
Efficient Frequent Pattern Mining in Relational Databases
Data mining on large relational databases has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind ...
Xuequn Shang, Kai-Uwe Sattler, Ingolf Geist
IEAAIE
2000
Springer
13 years 11 months ago
Dynamic Data Mining
Business information received from advanced data analysis and data mining is a critical success factor for companies wishing to maximize competitive advantage. The use of tradition...
Vijay V. Raghavan, Aladdin Hafez
CIKM
2010
Springer
13 years 2 months ago
Mining networks with shared items
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
Jun Sese, Mio Seki, Mutsumi Fukuzaki
KAIS
2008
119views more  KAIS 2008»
13 years 7 months ago
An information-theoretic approach to quantitative association rule mining
Abstract. Quantitative Association Rule (QAR) mining has been recognized an influential research problem over the last decade due to the popularity of quantitative databases and th...
Yiping Ke, James Cheng, Wilfred Ng