@article {14415,
	title = {Organizing User Search Histories},
	journal = {Knowledge and Data Engineering, IEEE Transactions on},
	volume = {24},
	year = {2012},
	month = {2012/05//},
	pages = {912 - 925},
	abstract = {Users are increasingly pursuing complex task-oriented goals on the web, such as making travel arrangements, managing finances, or planning purchases. To this end, they usually break down the tasks into a few codependent steps and issue multiple queries around these steps repeatedly over long periods of time. To better support users in their long-term information quests on the web, search engines keep track of their queries and clicks while searching online. In this paper, we study the problem of organizing a user{\textquoteright}s historical queries into groups in a dynamic and automated fashion. Automatically identifying query groups is helpful for a number of different search engine components and applications, such as query suggestions, result ranking, query alterations, sessionization, and collaborative search. In our approach, we go beyond approaches that rely on textual similarity or time thresholds, and we propose a more robust approach that leverages search query logs. We experimentally study the performance of different techniques, and showcase their potential, especially when combined together.},
	keywords = {alteration;query, analysis;user, engines;search, engines;text, goal;textual, group, historical, History, identification;query, information, interfaces;, log;sessionization;task-oriented, organization;query, processing;search, query, query;user, quest;query, ranking;search, search, search;long-term, similarity;time, suggestion;result, threshold;user, Web;collaborative},
	isbn = {1041-4347},
	doi = {10.1109/TKDE.2010.251},
	author = {Hwang,Heasoo and Lauw,H. W and Getoor, Lise and Ntoulas,A.}
}
@article {17397,
	title = {Temporal Summaries: Supporting Temporal Categorical Searching, Aggregation and Comparison},
	journal = {IEEE Transactions on Visualization and Computer Graphics},
	volume = {15},
	year = {2009},
	month = {2009/12//Nov},
	pages = {1049 - 1056},
	abstract = {When analyzing thousands of event histories, analysts often want to see the events as an aggregate to detect insights and generate new hypotheses about the data. An analysis tool must emphasize both the prevalence and the temporal ordering of these events. Additionally, the analysis tool must also support flexible comparisons to allow analysts to gather visual evidence. In a previous work, we introduced align, rank, and filter (ARF) to accentuate temporal ordering. In this paper, we present temporal summaries, an interactive visualization technique that highlights the prevalence of event occurrences. Temporal summaries dynamically aggregate events in multiple granularities (year, month, week, day, hour, etc.) for the purpose of spotting trends over time and comparing several groups of records. They provide affordances for analysts to perform temporal range filters. We demonstrate the applicability of this approach in two extensive case studies with analysts who applied temporal summaries to search, filter, and look for patterns in electronic health records and academic records.},
	keywords = {Aggregates, Collaborative work, Computational Biology, Computer Graphics, Data analysis, data visualisation, Data visualization, Databases, Factual, Displays, Event detection, Filters, Heparin, History, Human computer interaction, Human-computer interaction, HUMANS, Information Visualization, Interaction design, interactive visualization technique, Medical Records Systems, Computerized, Pattern Recognition, Automated, Performance analysis, Springs, temporal categorical data visualization, temporal categorical searching, temporal ordering, temporal summaries, Thrombocytopenia, Time factors},
	isbn = {1077-2626},
	doi = {10.1109/TVCG.2009.187},
	author = {Wang,T. D and Plaisant, Catherine and Shneiderman, Ben and Spring, Neil and Roseman,D. and Marchand,G. and Mukherjee,V. and Smith,M.}
}
@conference {17453,
	title = {Understanding social computing participation with visual exploration tools},
	booktitle = {International Symposium on Collaborative Technologies and Systems, 2009. CTS {\textquoteright}09},
	year = {2009},
	month = {2009/05/18/22},
	pages = {xi-xii - xi-xii},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The rapid growth of socio-technical systems, social media and social networking websites has raised the importance of understanding the determinants of their success. The pressure to understand success is increased by the shift from playful discretionary applications to mission critical applications in government, business, and civic settings. These include homeland defense, energy sustainability, environmental conservation, disaster response, and community safety. Information visualization tools and statistical methods can both be helpful, but their utility grows when they are well-integrated. This talk will demonstrate novel tools for network evolution and offer a framework for thinking about motivating technology-mediated social participation.},
	keywords = {Application software, Books, Collaborative tools, Computer science, Data visualization, Educational institutions, History, International collaboration, Social network services, Sociotechnical systems},
	isbn = {978-1-4244-4584-4},
	doi = {10.1109/CTS.2009.5067426},
	author = {Shneiderman, Ben}
}
@conference {13121,
	title = {Action recognition using ballistic dynamics},
	booktitle = {Computer Vision and Pattern Recognition, 2008. CVPR 2008. IEEE Conference on},
	year = {2008},
	month = {2008/06//},
	pages = {1 - 8},
	abstract = {We present a Bayesian framework for action recognition through ballistic dynamics. Psycho-kinesiological studies indicate that ballistic movements form the natural units for human movement planning. The framework leads to an efficient and robust algorithm for temporally segmenting videos into atomic movements. Individual movements are annotated with person-centric morphological labels called ballistic verbs. This is tested on a dataset of interactive movements, achieving high recognition rates. The approach is also applied on a gesture recognition task, improving a previously reported recognition rate from 84\% to 92\%. Consideration of ballistic dynamics enhances the performance of the popular Motion History Image feature. We also illustrate the approachpsilas general utility on real-world videos. Experiments indicate that the method is robust to view, style and appearance variations.},
	keywords = {analysis;image, Bayesian, dynamics;gesture, feature;person-centric, framework;action, History, image, labels;psycho-kinesiological, morphological, MOTION, Movement, movements;motion, planning;interactive, processing;, recognition, recognition;ballistic, recognition;image, segmentation;video, signal, studies;image, task;human},
	doi = {10.1109/CVPR.2008.4587806},
	author = {Vitaladevuni,S.N. and Kellokumpu,V. and Davis, Larry S.}
}
@conference {15271,
	title = {Uncovering Genomic Reassortments among Influenza Strains by Enumerating Maximal Bicliques},
	booktitle = {IEEE International Conference on Bioinformatics and Biomedicine, 2008. BIBM {\textquoteright}08},
	year = {2008},
	month = {2008/11/03/5},
	pages = {223 - 230},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The evolutionary histories of viral genomes have received significant recent attention due to their importance in understanding virulence and the corresponding ramifications to public health. We present a novel framework to detect reassortment events in influenza based on the comparison of two distributions of phylogenetic trees, rather than a pair of, possibly unreliable, consensus trees. We show how to detect all high-probability inconsistencies between two distributions of trees by enumerating maximal bicliques within a defined incompatibility graph. In the process, we give the first quadratic delay algorithm for enumerating maximal bicliques within general bipartite graphs. We demonstrate the utility of our approach by applying it to several sets of influenza genomes (both human- and avian-hosted) and successfully identify all known reassortment events and a few novel candidate reassortments. In addition, on simulated datasets, our approach correctly finds implanted reassortments and rarely detects reassortments where none were introduced.},
	keywords = {avian hosted influenza genome, Bioinformatics, Capacitive sensors, Delay, diseases, Event detection, general bipartite graphs, genomic reassortments, Genomics, graph theory, high probability inconsistencies, History, human hosted influenza genome, incompatibility graph, Influenza, influenza strain, maximal biclique, maximal biclique enumeration, microorganisms, phylogenetic trees, Phylogeny, Public healthcare, quadratic delay algorithm, reassortment, reassortment event detection, Tree graphs, viral genome evolutionary history, virulence},
	isbn = {978-0-7695-3452-7},
	doi = {10.1109/BIBM.2008.78},
	author = {Nagarajan,N. and Kingsford, Carl}
}
@conference {16951,
	title = {A Visual Interface for Multivariate Temporal Data: Finding Patterns of Events across Multiple Histories},
	booktitle = {Visual Analytics Science And Technology, 2006 IEEE Symposium On},
	year = {2006},
	month = {2006/11/31/Oct. },
	pages = {167 - 174},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Finding patterns of events over time is important in searching patient histories, Web logs, news stories, and criminal activities. This paper presents PatternFinder, an integrated interface for query and result-set visualization for search and discovery of temporal patterns within multivariate and categorical data sets. We define temporal patterns as sequences of events with inter-event time spans. PatternFinder allows users to specify the attributes of events and time spans to produce powerful pattern queries that are difficult to express with other formalisms. We characterize the range of queries PatternFinder supports as users vary the specificity at which events and time spans are defined. Pattern Finder{\textquoteright}s query capabilities together with coupled ball-and-chain and tabular visualizations enable users to effectively query, explore and analyze event patterns both within and across data entities (e.g. patient histories, terrorist groups, Web logs, etc.)},
	keywords = {ball-and-chain visualization, Chromium, Computer science, Data analysis, data visualisation, Data visualization, Database languages, event pattern discovery, Graphical user interfaces, History, Information Visualization, Medical treatment, multivariate temporal data, Pattern analysis, pattern recognition, PatternFinder integrated interface, Query processing, query visualization, result-set visualization, Spatial databases, tabular visualization, temporal pattern discovery, temporal pattern searching, Temporal query, user interface, User interfaces, visual databases, visual interface},
	isbn = {1-4244-0591-2},
	doi = {10.1109/VAST.2006.261421},
	author = {Fails,J. A and Karlson,A. and Shahamat,L. and Shneiderman, Ben}
}
@article {17293,
	title = {Meeting human needs with new digital imaging technologies},
	journal = {IEEE Multimedia},
	volume = {9},
	year = {2002},
	month = {2002/12//Oct},
	pages = {8 - 14},
	abstract = {It{\textquoteright}s a visual world. Images capture many people{\textquoteright}s thrills, emotions, and concerns. Art can shock or inspire, and family photos are some of our greatest treasures. It{\textquoteright}s not surprising that visual information is a vital component of the new computing. Most people depend on visual input to understand the world around them and as a basis for further creative activities. The popularity of visual media such as photos, short videos, and animations attests to their mainstream acceptance. Digital photos and image-laden Web pages have already become major computing applications, but users still want higher-resolution images and faster downloads},
	keywords = {animation, animations, Computer applications, digital images, digital imaging technologies, Helium, History, HUMANS, Image databases, IMAGE PROCESSING, Photography, photos, software libraries, Videos, visual media, Web pages},
	isbn = {1070-986X},
	doi = {10.1109/MMUL.2002.1041942},
	author = {Shneiderman, Ben}
}
@conference {17081,
	title = {Direct annotation: a drag-and-drop strategy for labeling photos},
	booktitle = {IEEE International Conference on Information Visualization, 2000. Proceedings},
	year = {2000},
	month = {2000///},
	pages = {88 - 95},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Annotating photographs is such a time-consuming, tedious and error-prone data entry task that it discourages most owners of personal photo libraries. By allowing the user to drag labels, such as personal names, from a scrolling list and drop them onto a photo, we believe we can make the task faster, easier and more appealing. Since the names are entered in a database, searching for all photos of a friend or family member is dramatically simplified. We describe the user interface design and the database schema to support direct annotation, as implemented in our PhotoFinder prototype},
	keywords = {Biomedical imaging, Cities and towns, Computer errors, Computer science, database indexing, database schema, Databases, digital libraries, direct annotation, direct manipulation, drag-and-drop strategy, Educational institutions, graphical user interface, Graphical user interfaces, History, hobby computing, image searching, label placement, Labeling, Laboratories, Libraries, personal information systems, personal names database, PhotoFinder prototype, photograph labelling, photographic libraries, Photography, scrolling list, user interface design, visual databases},
	isbn = {0-7695-0743-3},
	doi = {10.1109/IV.2000.859742},
	author = {Shneiderman, Ben and Kang,H.}
}
@conference {12197,
	title = {Domain name based visualization of Web histories in a zoomable user interface},
	booktitle = {11th International Workshop on Database and Expert Systems Applications, 2000. Proceedings},
	year = {2000},
	month = {2000///},
	pages = {591 - 598},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Users of hypertext systems like the World Wide Web (WWW) often find themselves following hypertext links deeper and deeper, only to find themselves {\textquotedblleft}lost{\textquotedblright} and unable to find their way back to the previously visited pages. We have implemented a Web browser companion called Domain Tree Browser (DTB) that builds a tree structured visual navigation history while browsing the Web. The Domain Tree Browser organizes the URLs visited based on the domain name of each URL and shows thumbnails of each page in a zoomable window},
	keywords = {Computer science, data visualisation, domain name, domain name based visualization, Domain Tree Browser, Educational institutions, History, hypermedia, hypertext links, hypertext systems, information resources, Navigation, online front-ends, thumbnails, Tree graphs, tree structured visual navigation history, Uniform resource locators, URLs, User interfaces, Visualization, Web browser companion, Web histories, Web pages, World Wide Web, zoomable user interface, zoomable window},
	isbn = {0-7695-0680-1},
	doi = {10.1109/DEXA.2000.875085},
	author = {Gandhi,R. and Kumar,G. and Bederson, Benjamin B. and Shneiderman, Ben}
}
@conference {16162,
	title = {Simulation based learning environments and the use of learning histories},
	booktitle = {CHI {\textquoteright}00 extended abstracts on Human factors in computing systems},
	series = {CHI EA {\textquoteright}00},
	year = {2000},
	month = {2000///},
	pages = {2 - 3},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We have developed an application framework for constructing simulation-based learning environments using dynamic simulations and visualizations to represent realistic time-dependent behavior. The development environment is described and many examples are given. In particular we will focus on the learning historian which provides users and learners with a manipulatable recording of their actions which facilitates the exchange of annotated history records among peers and mentors.},
	keywords = {education, engineering, History, learning, simulation},
	isbn = {1-58113-248-4},
	doi = {10.1145/633292.633294},
	url = {http://doi.acm.org/10.1145/633292.633294},
	author = {Rose,A. and Salter,R. and Keswani,S. and Kositsyna,N. and Plaisant, Catherine and Rubloff,G. and Shneiderman, Ben}
}
@conference {11986,
	title = {Independent motion: the importance of history},
	booktitle = {Computer Vision and Pattern Recognition, 1999. IEEE Computer Society Conference on.},
	volume = {2},
	year = {1999},
	month = {1999///},
	pages = {97 Vol. 2 - 97 Vol. 2},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We consider a problem central in aerial visual surveillance applications-detection and tracking of small, independently moving objects in long and noisy video sequences. We directly use spatiotemporal image intensity gradient measurements to compute an exact model of background motion. This allows the creation of accurate mosaics over many frames and the definition of a constraint violation function which acts as an indication of independent motion. A novel temporal integration method maintains confidence measures over long subsequences without computing the optic flow, requiring object models, or using a Kalman filler. The mosaic acts as a stable feature frame, allowing precise localization of the independently moving objects. We present a statistical analysis of the effects of image noise on the constraint violation measure and find a good match between the predicted probability distribution function and the measured sample frequencies in a test sequence},
	keywords = {aerial visual surveillance, background image, Fluid flow measurement, Frequency measurement, History, Motion detection, Motion estimation, Motion measurement, Noise measurement, Optical computing, Optical noise, spatiotemporal image intensity gradient measurements, Spatiotemporal phenomena, Surveillance, Video sequences},
	isbn = {0-7695-0149-4},
	doi = {10.1109/CVPR.1999.784614},
	author = {Pless, R. and Brodsky, T. and Aloimonos, J.}
}
@conference {17609,
	title = {Improved bounds and algorithms for hypergraph two-coloring},
	booktitle = {39th Annual Symposium on Foundations of Computer Science, 1998. Proceedings},
	year = {1998},
	month = {1998/11/08/11},
	pages = {684 - 693},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We show that for all large n, every n-uniform hypergraph with at most 0.7√(n/lnn){\texttimes}2n edges can be two-colored. We, in fact, present fast algorithms that output a proper two-coloring with high probability for such hypergraphs. We also derandomize and parallelize these algorithms, to derive NC1 versions of these results. This makes progress on a problem of Erdos (1963), improving the previous-best bound of n1/3-0(1){\texttimes}2n due to Beck (1978). We further generalize this to a {\textquotedblleft}local{\textquotedblright} version, improving on one of the first applications of the Lovasz Local Lemma},
	keywords = {algorithms, Application software, Approximation algorithms, bounds, computational geometry, Computer science, Contracts, Erbium, graph colouring, History, hypergraph two-coloring, Lab-on-a-chip, MATHEMATICS, n-uniform hypergraph, Parallel algorithms, Polynomials, probability},
	isbn = {0-8186-9172-7},
	doi = {10.1109/SFCS.1998.743519},
	author = {Radhakrishnan,J. and Srinivasan, Aravind}
}
@conference {16189,
	title = {Visualizing medical records with LifeLines},
	booktitle = {CHI 98 conference summary on Human factors in computing systems},
	series = {CHI {\textquoteright}98},
	year = {1998},
	month = {1998///},
	pages = {28 - 29},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	keywords = {healthcare, History, medical record, overview, timeline, Visualization},
	isbn = {1-58113-028-7},
	doi = {10.1145/286498.286513},
	url = {http://doi.acm.org/10.1145/286498.286513},
	author = {Plaisant, Catherine and Heller,Daniel and Li,Jia and Shneiderman, Ben and Mushlin,Rich and Karat,John}
}
@conference {16203,
	title = {LifeLines: visualizing personal histories},
	booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems: common ground},
	series = {CHI {\textquoteright}96},
	year = {1996},
	month = {1996///},
	pages = {221 - 227},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	keywords = {History, justice, medical record, overview, personal record, screen design, screen management, timeline, Visualization},
	isbn = {0-89791-777-4},
	doi = {10.1145/238386.238493},
	url = {http://doi.acm.org/10.1145/238386.238493},
	author = {Plaisant, Catherine and Milash,Brett and Rose,Anne and Widoff,Seth and Shneiderman, Ben}
}
@conference {13769,
	title = {Experimental investigation of high performance cognitive and interactive text filtering},
	booktitle = {, IEEE International Conference on Systems, Man and Cybernetics, 1995. Intelligent Systems for the 21st Century},
	volume = {5},
	year = {1995},
	month = {1995/10/22/25},
	pages = {4398-4403 vol.5 - 4398-4403 vol.5},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Text filtering has become increasingly important as the volume of networked information has exploded in recent years. This paper reviews recent progress in that field and reports on the development of a testbed for experimental investigation of cognitive and interactive text selection based on a history of user evaluations. An interactive filtering system model is presented and a new cognitive filtering technique which the authors call the Gaussian User Model is described. Because development of analytic measures of text selection effectiveness has proven intractable, the authors have modified the Cornell SMART text retrieval system to create a flexible text filtering testbed for experimental determination of filtering effectiveness. The paper concludes with a description of the design of this testbed system},
	keywords = {Cause effect analysis, Computer science, Contracts, Cornell SMART text retrieval system, Educational institutions, Gaussian User Model, high performance cognitive interactive text filtering, History, Information filtering, Information filters, Information retrieval, information retrieval system evaluation, Libraries, Matched filters, online front-ends, Query processing, System testing, text selection effectiveness, user evaluations, User interfaces, user modelling},
	isbn = {0-7803-2559-1},
	doi = {10.1109/ICSMC.1995.538486},
	author = {Oard, Douglas and DeClaris,N. and Dorr, Bonnie J and Faloutsos,C. and Marchionini,G.}
}
@article {16988,
	title = {Beyond intelligent machines: just do it},
	journal = {IEEE Software},
	volume = {10},
	year = {1993},
	month = {1993/01//},
	pages = {100 - 103},
	abstract = {The author argues that users want a sense of direct and immediate control over computers that differs from how they interact with people. He presents several examples of these predictable and controllable interfaces developed in the lab. The examples include tree maps and dynamic queries.<>},
	keywords = {Artificial intelligence, Computer aided instruction, Computer errors, controllable interfaces, Displays, dynamic queries, Educational institutions, History, HUMANS, intelligent machines, learning systems, Machine intelligence, predictable interfaces, Speech recognition, tree maps, User interfaces},
	isbn = {0740-7459},
	doi = {10.1109/52.207235},
	author = {Shneiderman, Ben}
}
@article {16764,
	title = {Incremental implementation model for relational databases with transaction time},
	journal = {IEEE Transactions on Knowledge and Data Engineering},
	volume = {3},
	year = {1991},
	month = {1991/12//},
	pages = {461 - 473},
	abstract = {An implementation model for the standard relational data model extended with transaction time is presented. The implementation model integrates techniques of view materialization, differential computation, and deferred update into a coherent whole. It is capable of storing any view (reflecting past or present states) and subsequently using stored views as outsets for incremental and decremental computations of requested views, making it more flexible than previously proposed partitioned storage models. The working and the expressiveness of the model are demonstrated by sample queries that show how historical data are retrieved},
	keywords = {Computational modeling, Computer science, Data models, data retrieval, Database languages, Database systems, database theory, decremental computations, deferred update, Degradation, differential computation, historical data, History, incremental computations, Information retrieval, partitioned storage models, queries, relational data model, Relational databases, stored views, Transaction databases, transaction time, view materialization},
	isbn = {1041-4347},
	doi = {10.1109/69.109107},
	author = {Jensen,C. S and Mark,L. and Roussopoulos, Nick}
}
