Sciweavers

93 search results - page 1 / 19
» Extracting k most important groups from data efficiently
Sort
View
DKE
2008
79views more  DKE 2008»
13 years 5 months ago
Extracting k most important groups from data efficiently
We study an important data analysis operator, which extracts the k most important groups from data (i.e., the k groups with the highest aggregate values). In a data warehousing co...
Man Lung Yiu, Nikos Mamoulis, Vagelis Hristidis
ICDE
2007
IEEE
206views Database» more  ICDE 2007»
14 years 6 months ago
Efficiently Processing Continuous k-NN Queries on Data Streams
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
Beng Chin Ooi, Christian Böhm, Claudia Plant,...
SDM
2009
SIAM
185views Data Mining» more  SDM 2009»
14 years 2 months ago
Understanding Importance of Collaborations in Co-authorship Networks: A Supportiveness Analysis Approach.
Co-authorship networks, an important type of social networks, have been studied extensively from various angles such as degree distribution analysis, social community extraction a...
Bin Zhou 0002, Jian Pei, Yan Jia, Yi Han
JCIT
2010
174views more  JCIT 2010»
12 years 11 months ago
Efficient Ming of Top-K Closed Sequences
Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...
Panida Songram
VISUALIZATION
2002
IEEE
13 years 10 months ago
Direct Surface Extraction from 3D Freehand Ultrasound Images
This paper presents a new technique for the extraction of surfaces from 3D ultrasound data. Surface extraction from ultrasound data is challenging for a number of reasons includin...
Youwei Zhang, Robert Rohling, Dinesh K. Pai