Sciweavers

177 search results - page 24 / 36
» Distributed Discovery of Large Near-Cliques
Sort
View
HPDC
2005
IEEE
14 years 1 months ago
Interest-aware information dissemination in small-world communities
Information dissemination is a fundamental and frequently occuring problem in large, dynamic, distributed systems. We propose a novel approach to this problem, interest-aware info...
Adriana Iamnitchi, Ian T. Foster
CLUSTER
2009
IEEE
14 years 2 months ago
Analyzing massive astrophysical datasets: Can Pig/Hadoop or a relational DBMS help?
Abstract— As the datasets used to fuel modern scientific discovery grow increasingly large, they become increasingly difficult to manage using conventional software. Parallel d...
Sarah Loebman, Dylan Nunley, YongChul Kwon, Bill H...
NPC
2004
Springer
14 years 23 days ago
Online Mining in Sensor Networks
Online mining in large sensor networks just starts to attract interest. Finding patterns in such an environment is both compelling and challenging. The goal of this position paper ...
Xiuli Ma, Dongqing Yang, Shiwei Tang, Qiong Luo, D...
KDD
1999
ACM
220views Data Mining» more  KDD 1999»
13 years 11 months ago
Efficient Mining of Emerging Patterns: Discovering Trends and Differences
We introduce a new kind of patterns, called emerging patterns (EPs), for knowledge discovery from databases. EPs are defined as itemsets whose supports increase significantly from...
Guozhu Dong, Jinyan Li
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
13 years 11 months ago
Scalable Parallel Data Mining for Association Rules
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
Eui-Hong Han, George Karypis, Vipin Kumar