Sciweavers

158 search results - page 31 / 32
» Discovering frequent patterns in sensitive data
Sort
View
DMKD
1997
ACM
198views Data Mining» more  DMKD 1997»
13 years 9 months ago
Clustering Based On Association Rule Hypergraphs
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...
Eui-Hong Han, George Karypis, Vipin Kumar, Bamshad...
ICDE
2010
IEEE
177views Database» more  ICDE 2010»
14 years 5 days ago
Optimal load shedding with aggregates and mining queries
— To cope with bursty arrivals of high-volume data, a DSMS has to shed load while minimizing the degradation of Quality of Service (QoS). In this paper, we show that this problem...
Barzan Mozafari, Carlo Zaniolo
ALMOB
2006
138views more  ALMOB 2006»
13 years 5 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh
IDA
2009
Springer
13 years 3 months ago
Mining the Temporal Dimension of the Information Propagation
In the last decade, Social Network Analysis has been a field in which the effort devoted from several researchers in the Data Mining area has increased very fast. Among the possibl...
Michele Berlingerio, Michele Coscia, Fosca Giannot...
BMCBI
2007
116views more  BMCBI 2007»
13 years 5 months ago
Ranked Adjusted Rand: integrating distance and partition information in a measure of clustering agreement
Background: Biological information is commonly used to cluster or classify entities of interest such as genes, conditions, species or samples. However, different sources of data c...
Francisco R. Pinto, João A. Carriço,...