Sciweavers

1083 search results - page 27 / 217
» Efficient Discovery of Confounders in Large Data Sets
Sort
View
ESA
2010
Springer
220views Algorithms» more  ESA 2010»
13 years 8 months ago
Data Structures for Storing Small Sets in the Bitprobe Model
abstract appeared in Proc. 24th Annual Symposium of Computational Geometry (SoCG), 2008, pp. 338-345. S. Shannigrahi and S. P. Pal, "Efficient Prufer-like Coding and Counting ...
Jaikumar Radhakrishnan, Smit Shah 0001, Saswata Sh...
FSKD
2010
Springer
270views Fuzzy Logic» more  FSKD 2010»
13 years 8 months ago
Ontology-based knowledge discovery and sharing in bioinformatics and medical informatics: A brief survey
Abstract--Worldwide health scientists are producing, accessing, analyzing, integrating, and storing massive amounts of digital medical data daily, through observation, experimentat...
Jingshan Huang, Dejing Dou, Lei He, Pat Hayes, Jia...
APPINF
2003
13 years 9 months ago
Fast Frequent Itemset Mining using Compressed Data Representation
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
Raj P. Gopalan, Yudho Giri Sucahyo
CIKM
2009
Springer
13 years 11 months ago
Efficient processing of group-oriented connection queries in a large graph
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
James Cheng, Yiping Ke, Wilfred Ng
DAGSTUHL
2009
13 years 8 months ago
Median Topographic Maps for Biomedical Data Sets
Abstract. Median clustering extends popular neural data analysis methods such as the self-organizing map or neural gas to general data structures given by a dissimilarity matrix on...
Barbara Hammer, Alexander Hasenfuss, Fabrice Rossi