B. Shneiderman, "Dynamic queries for visual information seeking," IEEE Software 11 6 , pp. 70--77, 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....within the slider knob always corresponds to the items displayed in the scroll window. When the user modifies the query pattern, string matching is immediately performed on all the entries in the list; the slider background and scroll window display also change immediately. With this dynamic query[18] feature, users can easily find the relationship between a query pattern and the distribution of data items. Dynamic approximate string matching When no entry in the list matches the specified pattern, dynamic approximate string matching[12] is done automatically, and entries closest to the ....

B. Shneiderman. Dynamic queries for visual information seeking. IEEE Software, 11(6):70--77, November 1994.

....users to formulate queries with graphical widgets, such as sliders. The goal of dynamic queries is that users see the results of query refinements as they make them. There have been many applications that employ dynamic queries and the benefits of using this approach have been well established [1,4,5,6]. Several experiments have demonstrated that dynamic queries help users find trends and exception conditions [4,5,6] Dynamic queries are clearly effective, particularly for novice users. However, on their own, they are not expressive enough to cover all the combinations of queries needed for our ....

....the results of query refinements as they make them. There have been many applications that employ dynamic queries and the benefits of using this approach have been well established [1,4,5,6] Several experiments have demonstrated that dynamic queries help users find trends and exception conditions [4,5,6]. Dynamic queries are clearly effective, particularly for novice users. However, on their own, they are not expressive enough to cover all the combinations of queries needed for our application. Mirel [3] has investigated the kinds of problems that users encounter in expressing complex ....

Shneiderman, B. Dynamic Queries: for visual information seeking. In IEEE Software, volume 11, Nov 1994, 70-77.

....dialog box that breaks their work flow. Because most of the scenarios begin with locating earlier documents, the standard File Open dialog box has been replaced by a more usable design that offers a continuous filter for the documents that can be edited by this program (see dynamic queries in [3]) When the user starts typing the name of the document or the project, the system dynamically filters the document list. When the user has found the document he is looking for, he opens it by selecting the row. The system opens the document on the right side of the window, and an icon of the ....

Shneiderman, B. Dynamic queries for visual information seeking. IEEE Software, Vol. 11, 70-77.

....to interface components. We integrate the domain model concept of sending queries to a temporal inference system with the task model concept of moving along various dimensions of abstraction by simply treating them as one and the same thing. Shneiderman describes this dynamic query method in [10]. It involves sending a series of rapid queries as users move along a navigation axis. Ahlberg and Shneiderman [1] Fishkin and Stone [3] and Goldstein and Roth [4] have all used this method for interactive navigation tasks. Unlike previous applications of the dynamic query method, KNAVE does not ....

Shneiderman, B. Dynamic Queries for Visual Information Seeking. IEEE Software 11, 6 (Nov 1994), 70-77.

....(25 documents matched tlm qmry) U . ty of Lds SCHOOL OF COMPUTER STUDIES Colorama of U . ty of Lees SCHOOL OF COMPUTER STUDIES i U . ity of Lees SCHOOL OF COMPUTER STUDIES Figure 2: The current NZDL interface, showing a query screen (left) and a results screen (right) [15]. Dynamic queries also restfit in tangible performance gains. Ahlberg et al. [1] found that subjects formed queries significantly faster using dynamic queries than with a text based form fill query interface. Conventionally, query parameters are controlled by slider user interface components, and ....

Shneiderman, B. Dynamic Queries for Visual Information Seeking. IEEE Software, 11, 6 (1994), 70- 7.

....archive. The background for interfaces to EOSDIS is discussed further on the web at [6] 1. 2 What are Dynamic Queries Dynamic queries are an interface paradigm that allow the user to interactively control query parameters and generate a rapidly animated visual display of database search results [1, 2, 5, 7, 8, 10 13, 15, 16]. As users adjust sliders or buttons, results are updated nearly continuously on the display. Each adjustment to a slider and each button click is called a query. The answer to the query is presented graphically. Experimental results have shown that dynamic queries are a fast, effective, fun, and ....

Shneiderman, B., Dynamic Queries for Visual Information Seeking, IEEE Softw., 11 (1994) 70--77

....provide navigation by clicking on object references, but do not support keyword search. Our system also provides more powerful browsing facilities. BBQ [11] presents an interface for blended browsing and querying but querying in BBQ requires the user to know the database schema. Shneiderman et al. [15] [16] have developed systems to display chemical elements, search for homes or movies, and so on, based on the concept of dynamic queries. Their systems focus on graphical user interface and do not consider keyword queries, unlike BANKS. Hulgeri et al. [8] provide a more detailed survey of related ....

B. Shneiderman. Dynamic queries for visual information seeking. IEEE Software, 11(6):70--77, 1994.

....base as large objects when a package is instantiated from a perspective. 4.3 Visual Query Interface In order to fulfill the fifth requirement, a search and retrieval interface that is easy to learn and selfexplanatory, we adopted a visual query interface (VQI) concept. As proposed by Shneiderman [13], visual query interfaces let users fly through stored information by adjusting widgets and viewing animated results in the computer screen. In EMS, they allow easy interactive querying of the repository based on various attributes of the experience packages. Built in to the interface is the set ....

Shneiderman, Ben. Dynamic Queries for Visual Information Seeking. IEEE Software, Vol. 6, No. 11, November 1994, pp 70-77.

....done by a physical action instead of entering the value by a keyboard. Such action is easily reversible by moving the drag box, if the obtained results are not what users expected. No action is illegal, hence error messages are not needed. More references to work on dynamic queries can be found in [9]. At Xerox PARC in the last ten years a group of researchers has developed several information visualizations, with the aim of helping the users understand and process the information stored into the system [10, 11, 12, 13] They have created the information workspaces , i.e. computer ....

Shneiderman, B. "Dynamic Queries for Visual Information Seeking", IEEE Software, 11, 1994, pp. 70-77.

No context found.

Shneiderman, B., Dynamic queries for visual information seeking, IEEE Software 11, 6 (1994), 70-77.

No context found.

B. Shneiderman. Dynamic queries for visual information seeking. IEEE Software, 11(6):70--77, November 1994.

....on screens or even large printouts can be improved by adding interactive exploration tools. Our goals were to provide four new features: overview of the entire dataset, coupled with a detail view so that high level patterns and hot spots can be easily found and examined dynamic query controls[5][6] so that users can restrict the number of clusters they view at a time and show those clusters more clearly coordinated displays: the overview mosaic has a bi directional link to 2dimensional scattergrams cluster comparisons to allow researchers to see how different clustering algorithms ....

....of clusters and then grows the region around the clusters. Recent work seeks to get beyond the limitation of spherical clusters [3] by using graph representations and developing clusters of arbitrary shapes, even interlocking geometries [4] All clustering methods face the challenges of validity [5]: Does the clustering reflect known classifications How many clusters are best What should be done about outliers or intruders to clusters What metrics could confirm or reject a perceived cluster 1. S.C. Johnson. Hierarchical clustering schemes . Psychometrika 32, 1967, pp. 241 254. 2. M.B. ....

B. Shneiderman, "Dynamic Queries: for visual information seeking," IEEE Software, Vol. 11(6), 1994, pp. 70-77.

....Newer and faster algorithms for data analysis are always in demand to harness the flood of data. If the amount of data can be reduced to a manageable size, then humans can find patterns that automated algorithms may have missed. Dynamic Queries (DQ) is an interactive technique for data exploration. [1] Users manipulate sliders to filter out data. Each slider corresponds to an attribute of the data. A requirement of dynamic queries is that the visualization must keep up with the user s manipulation within 100 milliseconds. Since a large portion of the computer s computation is spent on ....

Shneiderman, Ben. (1994). "Dynamic Queries for Visual Information Seeking." IEEE Software. 11(6), 70-77.

....together to modify the query constraints. The use of simple, familiar idioms for creation and modification of timeboxes supports interactive use with minimal cognitive overhead. Rapid automatic query processing ( 100 ms) on mouse up events provides the fast response necessary for dynamic queries [16], thus supporting interactive data exploration. Users can easily and quickly try a wide range of queries, and modify them to quickly see the effects of changes in query parameters. This ability to easily explore the data is helpful in identifying specific patterns of interest, as well as in ....

....and modify them to quickly see the effects of changes in query parameters. This ability to easily explore the data is helpful in identifying specific patterns of interest, as well as in gaining understanding of the data set as a whole. Timeboxes also differ from traditional dynamic query widgets [16] in their construction and manipulation directly on the data space. As timeboxes are drawn directly on a graph space suitable for plotting a time series, the queries are easily interpreted at a glance. 2.1 TimeSearcher TimeSearcher [9] uses timeboxes to pose queries over a set of entities with ....

B. Shneiderman. Dynamic queries for visual information seeking. IEEE Software, 11(6):70-77, November 1994.

No context found.

B. Shneiderman, "Dynamic queries for visual information seeking," IEEE Software 11 6 , pp. 70--77, 1994.

No context found.

Shneiderman, B. (1994). Dynamic Queries for Visual Information Seeking. Available at: ftp://ftp.cs.umd.edu/ pub/hcil/Reports-Abstracts-Bibliography/93-01html/ 3022.html. Accessed 19 May 2000.

No context found.

Shneiderman, B. (1994), Dynamic queries for visual information seeking, IEEE Software 11(6), 70-77.

No context found.

Shneiderman, B. Dynamic queries for visual information seeking. D@@@#T's##h...r 11, 6 (1994), 70-77.

No context found.

Shneiderman, B. Dynamic Queries for Visual Information Seeking. IEEE Software, 11,6 (1994), 70-77.

No context found.

SHNEIDERMAN, B. Dynamic queries for visual information seeking. IEEE Software 11 (November 1994), 70--77.

No context found.

Shneiderman, B. Dynamic Queries for Visual Information Seeking. In IEEE Software, Vol. 11, No. 6, pp. 70-77, IEEE Press, 1994.

No context found.

Shneiderman, B. Dynamic Queries for Visual Information Seeking. IEEE Software, Vol. 11, No. 6, pages 70-77, 1994.

No context found.

B. Shneiderman. Dynamic Queries for Visual Information Seeking. IEEE Software, 11(6), 70-77, 1994.

No context found.

Shneiderman, B. (1994). Dynamic Queries for Visual Information Seeking. Available at: ftp://ftp.cs.umd.edu/ pub/hcil/Reports-Abstracts-Bibliography/93-01html/ 3022.html. Accessed 19 May 2000.

No context found.

Shneiderman, B. (1994). Dynamic queries for visual information seeking. IEEE Software, 11, (6), 70-77.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC