Sciweavers

1403 search results - page 254 / 281
» Set cover algorithms for very large datasets
Sort
View
JCDL
2006
ACM
172views Education» more  JCDL 2006»
14 years 2 months ago
A comprehensive comparison study of document clustering for a biomedical digital library MEDLINE
Document clustering has been used for better document retrieval, document browsing, and text mining in digital library. In this paper, we perform a comprehensive comparison study ...
Illhoi Yoo, Xiaohua Hu
PAKDD
2005
ACM
124views Data Mining» more  PAKDD 2005»
14 years 1 months ago
Finding Sporadic Rules Using Apriori-Inverse
We define sporadic rules as those with low support but high confidence: for example, a rare association of two symptoms indicating a rare disease. To find such rules using the w...
Yun Sing Koh, Nathan Rountree
KDD
2010
ACM
214views Data Mining» more  KDD 2010»
14 years 10 days ago
Neighbor query friendly compression of social networks
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
Hossein Maserrat, Jian Pei
ICDCS
2007
IEEE
14 years 10 days ago
Communication-Efficient Tracking of Distributed Cumulative Triggers
In recent work, we proposed D-Trigger, a framework for tracking a global condition over a large network that allows us to detect anomalies while only collecting a very limited amo...
Ling Huang, Minos N. Garofalakis, Anthony D. Josep...
AUSDM
2006
Springer
118views Data Mining» more  AUSDM 2006»
14 years 6 days ago
Efficiently Identifying Exploratory Rules' Significance
How to efficiently discard potentially uninteresting rules in exploratory rule discovery is one of the important research foci in data mining. Many researchers have presented algor...
Shiying Huang, Geoffrey I. Webb