Sciweavers

4208 search results - page 423 / 842
» Challenges in Evaluating Distributed Algorithms
Sort
View
140
Voted
ICDM
2005
IEEE
150views Data Mining» more  ICDM 2005»
15 years 9 months ago
Combining Multiple Clusterings by Soft Correspondence
Combining multiple clusterings arises in various important data mining scenarios. However, finding a consensus clustering from multiple clusterings is a challenging task because ...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
123
Voted
PAKDD
2004
ACM
121views Data Mining» more  PAKDD 2004»
15 years 9 months ago
Secure Association Rule Sharing
Abstract. The sharing of association rules is often beneficial in industry, but requires privacy safeguards. One may decide to disclose only part of the knowledge and conceal stra...
Stanley R. M. Oliveira, Osmar R. Zaïane, Y&uu...
153
Voted
CVPR
2010
IEEE
15 years 7 months ago
Bundled Depth-Map Merging for Multi-View Stereo
Depth-map merging is one typical technique category for multi-view stereo (MVS) reconstruction. To guarantee accuracy, existing algorithms usually require either sub-pixel level s...
Jianguo Li
151
Voted
APVIS
2009
15 years 5 months ago
HiMap: Adaptive visualization of large-scale online social networks
Visualizing large-scale online social network is a challenging yet essential task. This paper presents HiMap, a system that visualizes it by clustered graph via hierarchical group...
Lei Shi, Nan Cao, Shixia Liu, Weihong Qian, Li Tan...
DAWAK
2010
Springer
15 years 5 months ago
Mining Closed Itemsets in Data Stream Using Formal Concept Analysis
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
Anamika Gupta, Vasudha Bhatnagar, Naveen Kumar