@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.}
}
@conference {13067,
	title = {Birdlets: Subordinate categorization using volumetric primitives and pose-normalized appearance},
	booktitle = {Computer Vision (ICCV), 2011 IEEE International Conference on},
	year = {2011},
	month = {2011/11//},
	pages = {161 - 168},
	abstract = {Subordinate-level categorization typically rests on establishing salient distinctions between part-level characteristics of objects, in contrast to basic-level categorization, where the presence or absence of parts is determinative. We develop an approach for subordinate categorization in vision, focusing on an avian domain due to the fine-grained structure of the category taxonomy for this domain. We explore a pose-normalized appearance model based on a volumetric poselet scheme. The variation in shape and appearance properties of these parts across a taxonomy provides the cues needed for subordinate categorization. Training pose detectors requires a relatively large amount of training data per category when done from scratch; using a subordinate-level approach, we exploit a pose classifier trained at the basic-level, and extract part appearance and shape information to build subordinate-level models. Our model associates the underlying image pattern parameters used for detection with corresponding volumetric part location, scale and orientation parameters. These parameters implicitly define a mapping from the image pixels into a pose-normalized appearance space, removing view and pose dependencies, facilitating fine-grained categorization from relatively few training examples.},
	keywords = {appearance, Birdlets;category, categorization;subordinate-level, detection;pose, detectors;pose-normalized, distinctions;shape, estimation;, extraction;pose, extraction;subordinate-level, information, model;salient, models;volumetric, pixels;part, poselet, primitives;computer, resolution;information, retrieval;object, scheme;volumetric, taxonomy;computer, vision;image},
	doi = {10.1109/ICCV.2011.6126238},
	author = {Farrell,R. and Oza,O. and Zhang,Ning and Morariu,V.I. and Darrell,T. and Davis, Larry S.}
}
@conference {16819,
	title = {Geotagging with local lexicons to build indexes for textually-specified spatial data},
	booktitle = {Data Engineering (ICDE), 2010 IEEE 26th International Conference on},
	year = {2010},
	month = {2010/03//},
	pages = {201 - 212},
	abstract = {The successful execution of location-based and feature-based queries on spatial databases requires the construction of spatial indexes on the spatial attributes. This is not simple when the data is unstructured as is the case when the data is a collection of documents such as news articles, which is the domain of discourse, where the spatial attribute consists of text that can be (but is not required to be) interpreted as the names of locations. In other words, spatial data is specified using text (known as a toponym) instead of geometry, which means that there is some ambiguity involved. The process of identifying and disambiguating references to geographic locations is known as geotagging and involves using a combination of internal document structure and external knowledge, including a document-independent model of the audience{\textquoteright}s vocabulary of geographic locations, termed its spatial lexicon. In contrast to previous work, a new spatial lexicon model is presented that distinguishes between a global lexicon of locations known to all audiences, and an audience-specific local lexicon. Generic methods for inferring audiences{\textquoteright} local lexicons are described. Evaluations of this inference method and the overall geotagging procedure indicate that establishing local lexicons cannot be overlooked, especially given the increasing prevalence of highly local data sources on the Internet, and will enable the construction of more accurate spatial indexes.},
	keywords = {data;Internet;data, databases;, databases;spatial, document, indexes;spatial, information, Internet;document-independent, knowledge;feature-based, lexicon, lexicons;location-based, locations;geotagging;inference, method;internal, methods;geographic, mining;geographic, model;external, model;textually-specified, queries;generic, queries;spatial, spatial, structure;local, systems;visual},
	doi = {10.1109/ICDE.2010.5447903},
	author = {Lieberman,M.D. and Samet, Hanan and Sankaranarayanan,J.}
}
@conference {16058,
	title = {VAST 2009 challenge: An insider threat},
	booktitle = {Visual Analytics Science and Technology, 2009. VAST 2009. IEEE Symposium on},
	year = {2009},
	month = {2009/10//},
	pages = {243 - 244},
	abstract = {The 4th VAST Challenge centered on a cyber analytics scenario and offered three mini-challenges with datasets of badge and network traffic data, a social network including geospatial information, and security video. Teams could also enter the Grand challenge which combined all three datasets. In this paper, we summarize the dataset, the overall scenario and the questions asked in the challenges. We describe the judging process and new infrastructure developed to manage the submissions and compute accuracy measures in the social network mini challenge. We received 49 entries from 30 teams, and gave 23 different awards to a total of 16 teams.},
	keywords = {2009, analytics;data, analytics;geospatial, challenge;cyber, data;security, information, information;human, interaction;network, interfaces;, network;visual, traffic, user, VAST, video;social, visualisation;graphical},
	doi = {10.1109/VAST.2009.5334454},
	author = {Grinstein,G. and Scholtz,J. and Whiting,M. and Plaisant, Catherine}
}
@conference {16837,
	title = {Augmenting spatio-textual search with an infectious disease ontology},
	booktitle = {Data Engineering Workshop, 2008. ICDEW 2008. IEEE 24th International Conference on},
	year = {2008},
	month = {2008/04//},
	pages = {266 - 269},
	abstract = {A system is described that automatically categorizes and classifies infectious disease incidence reports by type and geographic location, to aid analysis by domain experts. It identifies references to infectious diseases by using a disease ontology. The system leverages the textual and spatial search capabilities of the STEWARD system to enable queries such as reports on "influenza" near "Hong Kong", possibly within a particular time period. Documents from the U.S. National Library of Medicine (http://www.pubmed.gov) and the World Health Organization (http://www.who.int) are tagged so that spatial relationships to specific disease occurrences can be presented graphically via a map interface. In addition, newspaper articles can be tagged and indexed to bolster the surveillance of ongoing epidemics. Examining past epidemics using this system may lead to improved understanding of the cause and spread of infectious diseases.},
	keywords = {(artificial, article;ontology;spatio-textual, disease;map, engines;, information, intelligence);search, interface;newspaper, search;classification;diseases;indexing;medical, STEWARD, system;classification;epidemics;indexing;infectious, systems;ontologies},
	doi = {10.1109/ICDEW.2008.4498330},
	author = {Lieberman,M.D. and Sankaranarayanan,J. and Samet, Hanan and Sperling,J.}
}
@conference {13991,
	title = {Microphone Arrays as Generalized Cameras for Integrated Audio Visual Processing},
	booktitle = {Computer Vision and Pattern Recognition, 2007. CVPR {\textquoteright}07. IEEE Conference on},
	year = {2007},
	month = {2007/06//},
	pages = {1 - 8},
	abstract = {Combinations of microphones and cameras allow the joint audio visual sensing of a scene. Such arrangements of sensors are common in biological organisms and in applications such as meeting recording and surveillance where both modalities are necessary to provide scene understanding. Microphone arrays provide geometrical information on the source location, and allow the sound sources in the scene to be separated and the noise suppressed, while cameras allow the scene geometry and the location and motion of people and other objects to be estimated. In most previous work the fusion of the audio-visual information occurs at a relatively late stage. In contrast, we take the viewpoint that both cameras and microphone arrays are geometry sensors, and treat the microphone arrays as generalized cameras. We employ computer-vision inspired algorithms to treat the combined system of arrays and cameras. In particular, we consider the geometry introduced by a general microphone array and spherical microphone arrays. The latter show a geometry that is very close to central projection cameras, and we show how standard vision based calibration algorithms can be profitably applied to them. Experiments are presented that demonstrate the usefulness of the considered approach.},
	keywords = {algorithms;generalized, arrays;scene, arrays;sensor, audio, audio-visual, cameras;geometrical, fusion;, fusion;computer-vision, geometry;sound, information, information;geometry, inspired, location;acoustic, processing;array, processing;audio-visual, processing;microphone, sensors;integrated, signal, sources;source, systems;cameras;computer, vision;geometry;microphone, visual},
	doi = {10.1109/CVPR.2007.383345},
	author = {O{\textquoteright}Donovan,A. and Duraiswami, Ramani and Neumann, J.}
}
@conference {16083,
	title = {VAST 2006 Contest - A Tale of Alderwood},
	booktitle = {Visual Analytics Science And Technology, 2006 IEEE Symposium On},
	year = {2006},
	month = {2006/11/31/2},
	pages = {215 - 216},
	abstract = {Visual analytics experts realize that one effective way to push the field forward and to develop metrics for measuring the performance of various visual analytics components is to hold an annual competition. The first visual analytics science and technology (VAST) contest was held in conjunction with the 2006 IEEE VAST Symposium. The competition entailed the identification of possible political shenanigans in the fictitious town of Alderwood. A synthetic data set was made available as well as tasks. We summarize how we prepared and advertised the contest, developed some initial metrics for evaluation, and selected the winners. The winners were invited to participate at an additional live competition at the symposium to provide them with feedback from senior analysts},
	keywords = {Alderwood;human, analysis;data, analytics, and, contest;data, information, interaction;sense, making;visual, Science, technology, visualisation;},
	doi = {10.1109/VAST.2006.261420},
	author = {Grinstein,G. and O{\textquoteright}Connell,T. and Laskowski,S. and Plaisant, Catherine and Scholtz,J. and Whiting,M.}
}
@conference {14026,
	title = {The manifolds of spatial hearing},
	booktitle = {Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP {\textquoteright}05). IEEE International Conference on},
	volume = {3},
	year = {2005},
	month = {2005/03//},
	pages = {iii/285 - iii/288 Vol. 3 - iii/285 - iii/288 Vol. 3},
	abstract = {We present exploratory studies on learning the non-linear manifold structure, in head related impulse responses (HRIRs). We use the recently popular locally linear embedding technique. The lower dimensional manifold encodes the perceptual information in the HRIRs, namely the direction of the sound source. Based on this, we propose a new method for HRIR interpolation. We also propose that the distance between two HRIRs of an individual be taken as the geodesic distance on the learned manifold.},
	keywords = {acoustics;, dimensional, direction, distance;, EMBEDDING, encoding;, geodesic, Head, hearing, hearing;, HRIR, impulse, information, interpolation;, learned, linear, localization;, locally, low, manifold, manifold;, manifolds;, nonlinear, perceptual, related, response;, responses;, sound, source, spatial, structure;, technique;, transient},
	doi = {10.1109/ICASSP.2005.1415702},
	author = {Duraiswami, Ramani and Raykar,V.C.}
}
@conference {15029,
	title = {Strategies for exploring large scale data},
	booktitle = {Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on},
	year = {2004},
	month = {2004/05//},
	pages = {2 - 2},
	abstract = {We consider the problem of querying large scale multidimensional time series data to discover events of interest, test and validate hypotheses, or to associate temporal patterns with specific events. This type of data currently dominates most other types of available data, and will very likely become even more prevalent in the future given the current trends in collecting time series of business, scientific, demographic, and simulation data. The ability to explore such collections interactively, even at a coarse level, will be critical in discovering the information and knowledge embedded in such collections. We develop indexing techniques and search algorithms to efficiently handle temporal range value querying of multidimensional time series data. Our indexing uses linear space data structures that enable the handling of queries in I/O time that is essentially the same as that of handling a single time slice, assuming the availability of a logarithmic number of processors as a function of the temporal window. A data structure with provably almost optimal asymptotic bounds is also presented for the case when the number of multidimensional objects is relatively small. These techniques improve significantly over standard techniques for either serial or parallel processing, and are evaluated by extensive experimental results that confirm their superior performance.},
	keywords = {algorithms;, association;, asymptotic, bounds;, business, data, data;, database, databases;, demographic, discovery;, Indexing, indexing;, information, knowledge, large, linear, mining;, multidimensional, objects;, optimal, Parallel, pattern, processing;, query, querying;, range, scale, scientific, search, serial, series, series;, simulation, space, structure;, structures;, techniques;, temporal, TIME, value, very, window;},
	doi = {10.1109/ISPAN.2004.1300447},
	author = {JaJa, Joseph F.}
}
@conference {12304,
	title = {Cooperative peer groups in NICE},
	booktitle = {INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies},
	volume = {2},
	year = {2003},
	month = {2003///},
	pages = {1272 - 1282 vol.2 - 1272 - 1282 vol.2},
	abstract = {A distributed scheme for trust inference in peer-to-peer networks is presented. Our work is in context of the NICE system, which is a platform for implementing cooperative applications over the Internet. We describe a technique for efficiently storing user reputation information in a completely decentralized manner, and show how this information can be used to efficiently identify noncooperative users in NICE. We present a simulation based study of our algorithms, in which we show our scheme scales to thousands of users using modest amounts of storage, processing, and bandwidth at any individual node. Lastly, we show that our scheme is robust and can form cooperative groups in systems where the vast majority of users are malicious.},
	keywords = {algorithm;, cooperative, decentralized, distributed, identification;, individual, inference, inference;, information, Internet;, malicious, manner;, mechanisms;, networks;, NICE, node;, noncooperative, peer-to-peer, platform;, reputation, retrieval;, storage;, system;, trust, users, users;},
	doi = {10.1109/INFCOM.2003.1208963},
	author = {Lee,S. and Sherwood,R. and Bhattacharjee, Bobby}
}
@conference {16153,
	title = {Interactive information visualization of a million items},
	booktitle = {Information Visualization, 2002. INFOVIS 2002. IEEE Symposium on},
	year = {2002},
	month = {2002///},
	pages = {117 - 124},
	abstract = {Existing information visualization techniques are usually limited to the display of a few thousand items. This article describes new interactive techniques capable of handling a million items (effectively visible and manageable on screen). We evaluate the use of hardware-based techniques available with newer graphics cards, as well as new animation techniques and non-standard graphical features such as stereovision and overlap count. These techniques have been applied to two popular information visualizations: treemaps and scatter plot diagrams; but are generic enough to be applied to other 2D representations as well.},
	keywords = {animation, animation;, cards;, Computer, count;, data, diagrams;, Graphics, hardware-based, information, interactive, interpolation;, overlap, plot, scatter, stereovision;, systems;, techniques;, treemaps;, visualisation;, visualization;},
	doi = {10.1109/INFVIS.2002.1173156},
	author = {Fekete,J.-D. and Plaisant, Catherine}
}
@conference {15898,
	title = {Rapidly retargetable interactive translingual retrieval},
	booktitle = {Proceedings of the first international conference on Human language technology research},
	series = {HLT {\textquoteright}01},
	year = {2001},
	month = {2001///},
	pages = {1 - 5},
	publisher = {Association for Computational Linguistics},
	organization = {Association for Computational Linguistics},
	address = {Stroudsburg, PA, USA},
	abstract = {This paper describes a system for rapidly retargetable interactive translingual retrieval. Basic functionality can be achieved for a new document language in a single day, and further improvements require only a relatively modest additional investment. We applied the techniques first to search Chinese collections using English queries, and have successfully added French, German, and Italian document collections. We achieve this capability through separation of language-dependent and language-independent components and through the application of asymmetric techniques that leverage an extensive English retrieval infrastructure.},
	keywords = {cross-language, information, retrieval},
	doi = {10.3115/1072133.1072212},
	url = {http://dx.doi.org/10.3115/1072133.1072212},
	author = {Levow,Gina-Anne and Oard, Douglas and Resnik, Philip}
}
@conference {16164,
	title = {Evaluation challenges for a Federation of heterogeneous information providers: the case of NASA{\textquoteright}s Earth Science Information Partnerships},
	booktitle = {Enabling Technologies: Infrastructure for Collaborative Enterprises, 2000. (WET ICE 2000). Proeedings. IEEE 9th International Workshops on},
	year = {2000},
	month = {2000///},
	pages = {130 - 135},
	abstract = {NASA{\textquoteright}s Earth Science Information Partnership Federation is an experiment funded to assess the ability of a group of widely heterogeneous earth science data or service providers to self organize and provide improved and affordable access to an expanding earth science user community. As it is self-organizing, the Federation is mandated to set in place an evaluation methodology and collect metrics reflecting the outcomes and benefits of the Federation. This paper describes the challenges of organizing such a federated partnership self-evaluation and discusses the issues encountered during the metrics definition phase of the early data collection. Our experience indicates that a large number of metrics will be needed to fully represent the activities and strengths of all partners, but because of the heterogeneity of the ESIPs the qualitative data (comments accompanying the metric data and success stories) becomes the most useful information. Other lessons learned included the absolute need for online browsing tools to accompany data collection tools. Finally, our experience confirms the effect of evaluation as an agent of change, the best example being the high level of collaboration among the ESIPs which can be in part attributed to the initial identification of collaboration as one of the important evaluation factors of the Federation},
	keywords = {Browsing, collection;heterogeneous, computing;groupware;, data;online, Earth, Federation;data, information, NASA{\textquoteright}s, Partnership, Science, systems;geophysics, tools;geographic},
	doi = {10.1109/ENABL.2000.883717},
	author = {Plaisant, Catherine and Komlodi,A. and Lindsay,F.}
}
@article {14988,
	title = {Models and high-performance algorithms for global BRDF retrieval},
	journal = {Computational Science Engineering, IEEE},
	volume = {5},
	year = {1998},
	month = {1998/12//oct},
	pages = {16 - 29},
	abstract = {The authors describe three models for retrieving information related to the scattering of light on the Earth{\textquoteright}s surface. Using these models, they{\textquoteright}ve developed algorithms for the IBM SP2 that efficiently retrieve this information},
	keywords = {algorithms;, BRDF, Earth, geomorphology;, geophysical, global, high-performance, IBM, information, light, machines;, models;, Parallel, processing;, reflectivity;, retrieval, retrieval;, scattering;, signal, SP2;, surface;},
	isbn = {1070-9924},
	doi = {10.1109/99.735892},
	author = {Zengyan Zhang and Kalluri, SNV and JaJa, Joseph F. and Liang,Shunlin and Townshend,J.R.G.}
}
@conference {17928,
	title = {FINESSE: a financial information spreadsheet},
	booktitle = {Information Visualization {\textquoteright}96, Proceedings IEEE Symposium on},
	year = {1996},
	month = {1996/10//},
	pages = {70 -71, 125 - 70 -71, 125},
	abstract = {We outline a spreadsheet-based system for visualization of real-time financial information. Our system permits the user to define arithmetic and presentation relationships amongst the various cells of the spreadsheet. The cells contain primitives that can be numbers, text, images, functions and graphics. Presenting financial information in this format allows its intended clients, the financial analysts, to work in the familiar environment of a spreadsheet and allows them the flexibility afforded by the powerful interface of the spreadsheet paradigm. In addition, our system permits real-time visualization of the financial data stream allowing its user to visually trade the changing market trends in two and three dimensions},
	keywords = {cells;text;three, data, dimensions;two, dimensions;user, financial, FINESSE;arithmetic;data, information, information;spreadsheet, interface;data, interfaces;, presentation;market, processing;real-time, programs;user, spreadsheet;functions;graphics;images;information, systems;spreadsheet, trends;numbers;presentation;real-time, visualisation;financial, visualization;financial},
	doi = {10.1109/INFVIS.1996.559222},
	author = {Varshney, Amitabh and Kaufman,A.}
}
@conference {16201,
	title = {Query previews in networked information systems},
	booktitle = {Research and Technology Advances in Digital Libraries, 1996. ADL {\textquoteright}96., Proceedings of the Third Forum on},
	year = {1996},
	month = {1996/05//},
	pages = {120 - 129},
	abstract = {In a networked information system (such as the NASA Earth Observing System-Data Information System (EOS-DIS)), there are three major obstacles facing users in a querying process: network performance, data volume and data complexity. In order to overcome these obstacles, we propose a two phase approach to query formulation. The two phases are the Query Preview and the Query Refinement. In the Query Preview phase, users formulate an initial query by selecting rough attribute values. The estimated number of matching data sets is shown, graphically on preview bars which allows users to rapidly focus on a manageable number of relevant data sets. Query previews also prevent wasted steps by eliminating zero hit queries. When the estimated number of data sets is long enough, the initial query is submitted to the network which returns the metadata of the data sets for further refinement in the Query Refinement phase. The two phase approach to query formulation overcomes slow network performance, and reduces the data volume and data complexity, problems. This approach is especially appropriate for users who do not have extensive knowledge about the data and who prefer an exploratory method to discover data patterns and exceptions. Using this approach, we have developed dynamic query user interfaces to allow users to formulate their queries across a networked environment},
	keywords = {attribute, complexity;data, data, Earth, environment;networked, EOS-DIS;NASA, formulation;querying, formulation;user, hit, information, interfaces;, interfaces;exploratory, method;matching, networks;information, Observing, patterns;data, performance;networked, Preview;Query, process;rough, queries;computer, query, refinement;data, retrieval;information, services;interactive, sets;network, System-Data, System;Query, systems;query, user, values;zero, volume;dynamic},
	doi = {10.1109/ADL.1996.502522},
	author = {Donn,K. and Plaisant, Catherine and Shneiderman, Ben}
}
@conference {13660,
	title = {Temporal clues in handwriting},
	booktitle = {Pattern Recognition, 1992. Vol.II. Conference B: Pattern Recognition Methodology and Systems, Proceedings., 11th IAPR International Conference on},
	year = {1992},
	month = {1992/09/03/aug},
	pages = {317 - 320},
	abstract = {Handwritten character recognition is typically classified as online or offline depending on the nature of the input data. Online data consists of a temporal sequence of instrument positions while offline data is in the form of a 2D image of the writing sample. Online recognition techniques have been relatively successful but have the disadvantage of requiring the data to be gathered during the writing process. This paper presents work on the extraction of temporal information from static images of handwriting and its implications for character recognition},
	keywords = {character, extraction;, feature, handwriting, information, offline, online, recognition;, techniques;, temporal},
	doi = {10.1109/ICPR.1992.201781},
	author = {David Doermann and Rosenfeld, A.}
}
