“…Known-item Tree navigation Multiple concepts Query (n ϭ 18) (n ϭ 9) (n ϭ 5) (Similarity) Outliers reformulation Becks, 2002Chung, 2005Barlow, 2001Cribbin, 2001Becks, 2002Veerasamy, 1997Chen, 1998Cribbin, 2001Becks, 2002Rivadeneira, 2003Koshman, 2005 Change query parameters Chung, 2005Grun, 2005Kobsa, 2004Sutcliffe, 2000 Find documents based on search results Cribbin, 2001Kobsa, 2001Plaisant, 2002 Find multiple that are NOT like Eibl, 2002Rivadeneira, 2003Risden, 2000 similar/related the rest of a Grun, 2005Swan, 1998 Navigating and finding documents collection subset Hedman, 2004Turetken, 2005 nodes in a hierachical Koshman, 2005 Westerman, 2000 classification structure Modjeska, 2000Zhang, 2005Modjeska, 2003Perez, 2004Sebrechts, 1999Sutcliffe, 2000Turetken, 2005Veerasamy, 1996Veerasamy, 1997Westerman, 2005Zhang, 2005 Note. N Ͼ 31 since some studies test multiple task types.…”