Sciweavers

462 search results - page 17 / 93
» Covering a Tree by a Forest
Sort
View
ICONFERENCE
2012
12 years 2 months ago
No forests without trees: particulars and patterns in visualizing personal communication
When people use visualizations of conversational archives, they typically reflect on particular events, rather than patterns of activity over time. We explore whether this is a fu...
Ou Jie Zhao, Tiffany Ng, Dan Cosley
COCOA
2008
Springer
13 years 9 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner
CATA
2009
13 years 8 months ago
Nearest Shrunken Centroid as Feature Selection of Microarray Data
The nearest shrunken centroid classifier uses shrunken centroids as prototypes for each class and test samples are classified to belong to the class whose shrunken centroid is nea...
Myungsook Klassen, Nyunsu Kim
APPROX
2007
Springer
115views Algorithms» more  APPROX 2007»
14 years 1 months ago
Improved Approximation Algorithms for the Spanning Star Forest Problem
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad...
IBPRIA
2007
Springer
13 years 11 months ago
Random Forest for Gene Expression Based Cancer Classification: Overlooked Issues
Random forest is a collection (ensemble) of decision trees. It is a popular ensemble technique in pattern recognition. In this article, we apply random forest for cancer classifica...
Oleg Okun, Helen Priisalu