Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- MMU Press (228)
- University of Dayton (78)
- Missouri University of Science and Technology (16)
- Dakota State University (12)
- Chapman University (9)
-
- San Jose State University (8)
- University of Nebraska - Lincoln (5)
- University of South Alabama (5)
- Western Kentucky University (5)
- California Polytechnic State University, San Luis Obispo (4)
- California State University, San Bernardino (3)
- East Tennessee State University (3)
- LSU New Orleans (3)
- Montclair State University (3)
- Nova Southeastern University (3)
- Technological University Dublin (3)
- The University of Akron (3)
- Boise State University (2)
- Bryant University (2)
- City University of New York (CUNY) (2)
- Embry-Riddle Aeronautical University (2)
- Georgia Southern University (2)
- Harrisburg University of Science and Technology (2)
- Michigan Technological University (2)
- Prairie View A&M University (2)
- Stephen F. Austin State University (2)
- University of Nebraska at Omaha (2)
- University of New Mexico (2)
- West Virginia University (2)
- Bemidji State University (1)
- Keyword
-
- Machine Learning (55)
- Deep Learning (27)
- Artificial Intelligence (24)
- Natural Language Processing (12)
- Sentiment Analysis (10)
-
- Blockchain (9)
- Classification (9)
- Cybersecurity (9)
- Data Mining (8)
- Random Forest (8)
- Convolutional Neural Network (7)
- Editorial Preview (7)
- Support Vector Machine (7)
- Computer Vision (6)
- Deep learning (6)
- Internet of Things (6)
- Long Short-Term Memory (6)
- Machine learning (6)
- Peer-to-peer computing (6)
- Automation (5)
- Convolutional Neural Networks (5)
- Cyber Security (5)
- Data Mining, Software Engineering (5)
- Recommender System (5)
- Recommender Systems (5)
- Software Engineering (5)
- Sustainable Development Goals (5)
- Clustering (4)
- Computer Science (4)
- Computer science (4)
- Publication Year
- Publication
-
- Journal of Informatics and Web Engineering (228)
- Computer Science Faculty Publications (49)
- MIS/OM/DS Faculty Publications (19)
- Computer Science Faculty Research & Creative Works (16)
- MAICS: The Modern Artificial Intelligence and Cognitive Science Conference (12)
-
- Masters Theses & Doctoral Dissertations (10)
- Master's Projects (4)
- CCAC Theses and Dissertations (3)
- Department of Computer Science Faculty Scholarship and Creative Works (3)
- Electronic Theses and Dissertations (3)
- Electronic Theses, Projects, and Dissertations (3)
- LSU New Orleans Theses and Dissertations (3)
- Mathematics, Physics, and Computer Science Faculty Articles and Research (3)
- Shelby Hall Graduate Research Forum Posters (3)
- Williams Honors College, Honors Research Projects (3)
- Applications and Applied Mathematics: An International Journal (AAM) (2)
- Computer Science Working Papers (2)
- Computer Science and Software Engineering (2)
- Conference papers (2)
- Dissertations (2)
- Dissertations, Master's Theses and Master's Reports (2)
- Engineering Faculty Articles and Research (2)
- Graduate Theses, Dissertations, and Problem Reports (ETD) (2)
- Open Educational Resources (2)
- Research & Publications (2)
- School of Computing: Conference and Workshop Papers (2)
- UNO Student Research and Creative Activity Fair (2)
- Undergraduate Honors Theses (2)
- Al-Bahir (1)
- Art Faculty Articles and Research (1)
- Publication Type
Articles 391 - 420 of 443
Full-Text Articles in Other Computer Sciences
Program Transformations For Information Personalization, Saverio Perugini, Naren Ramakrishnan
Program Transformations For Information Personalization, Saverio Perugini, Naren Ramakrishnan
Computer Science Faculty Publications
Personalization constitutes the mechanisms necessary to automatically customize information content, structure, and presentation to the end user to reduce information overload. Unlike traditional approaches to personalization, the central theme of our approach is to model a website as a program and conduct website transformation for personalization by program transformation (e.g., partial evaluation, program slicing). The goal of this paper is study personalization through a program transformation lens and develop a formal model, based on program transformations, for personalized interaction with hierarchical hypermedia. The specific research issues addressed involve identifying and developing program representations and transformations suitable for classes of hierarchical …
Choosing Management Information Systems As A Major: Understanding The Smifactors For Mis, Thomas W. Ferratt, Stephen R. Hall, Jayesh Prasad, Donald E. Wynn
Choosing Management Information Systems As A Major: Understanding The Smifactors For Mis, Thomas W. Ferratt, Stephen R. Hall, Jayesh Prasad, Donald E. Wynn
MIS/OM/DS Faculty Publications
Given declining management information systems (MIS) enrollments at our university, we seek to understand our students‘ selection of a major. Prior studies have found that students choose a major based on a number of factors, with subject matter interest consistently being most important. We contribute to the literature by developing a deeper understanding of what is meant by subject matter interest, which we refer to as smiFactors, for MIS as a major and career. Based on a qualitative analysis of open-ended survey questions completed by undergraduate business students, we confirm a number of smiFactors for MIS gleaned from recent studies …
A Comparative Study Of Filter-Based Feature Ranking Techniques, Huanjing Wang, Taghi M. Khoshgoftaar, Kehan Gao
A Comparative Study Of Filter-Based Feature Ranking Techniques, Huanjing Wang, Taghi M. Khoshgoftaar, Kehan Gao
Computer Science Faculty Publications
One factor that affects the success of machine learning is the presence of irrelevant or redundant information in the training data set. Filter-based feature ranking techniques (rankers) rank the features according to their relevance to the target attribute and we choose the most relevant features to build classification models subsequently. In order to evaluate the effectiveness of different feature ranking techniques, a commonly used method is to assess the classification performance of models built with the respective selected feature subsets in terms of a given performance metric (e.g., classification accuracy or misclassification rate). Since a given performance metric usually can …
A Comparative Study Of Threshold-Based Feature Selection Techniques, Huanjing Wang, Taghi M. Khoshgoftaar, Jason Van Hulse
A Comparative Study Of Threshold-Based Feature Selection Techniques, Huanjing Wang, Taghi M. Khoshgoftaar, Jason Van Hulse
Computer Science Faculty Publications
Abstract Given high-dimensional software measurement data, researchers and practitioners often use feature (metric) selection techniques to improve the performance of software quality classification models. This paper presents our newly proposed threshold-based feature selection techniques, comparing the performance of these techniques by building classification models using five commonly used classifiers. In order to evaluate the effectiveness of different feature selection techniques, the models are evaluated using eight different performance metrics separately since a given performance metric usually captures only one aspect of the classification performance. All experiments are conducted on three Eclipse data sets with different levels of class imbalance. The …
Measurement And Interpolation Of Sea Surface Temperature And Salinity In The Tropical Pacific: A 9,000 Nautical Mile Research Odyssey, Amber Brooks
Earth and Soil Sciences
The purpose of this project was to compare spline and inverse distance weighting interpolation tools on data collected in the tropical Pacific Ocean by ship and data from a global network of CTD floats, known as Argo floats (fig.1), to provide evidence that technological advancement and integration is aiding our understanding of the ocean-atmosphere system of planet Earth. Thirty-one sea surface temperature and salinity samples were manually taken across a 9,000 nautical mile trek of the Pacific Ocean for the months of April, May and June 2008. Argo ASCII globally gridded monthly averaged sea surface temperature and salinity data, from …
Re-Solving Stochastic Programming Models For Airline Revenue Management, Lijian Chen, Tito Homem-De-Mello
Re-Solving Stochastic Programming Models For Airline Revenue Management, Lijian Chen, Tito Homem-De-Mello
MIS/OM/DS Faculty Publications
We study some mathematical programming formulations for the origin-destination model in airline revenue management. In particular, we focus on the traditional probabilistic model proposed in the literature. The approach we study consists of solving a sequence of two-stage stochastic programs with simple recourse, which can be viewed as an approximation to a multi-stage stochastic programming formulation to the seat allocation problem. Our theoretical results show that the proposed approximation is robust, in the sense that solving more successive two-stage programs can never worsen the expected revenue obtained with the corresponding allocation policy. Although intuitive, such a property is known not …
Personalization By Website Transformation: Theory And Practice, Saverio Perugini
Personalization By Website Transformation: Theory And Practice, Saverio Perugini
Computer Science Faculty Publications
We present an analysis of a progressive series of out-of-turn transformations on a hierarchical website to personalize a user’s interaction with the site. We formalize the transformation in graph-theoretic terms and describe a toolkit we built that enumerates all of the traversals enabled by every possible complete series of these transformations in any site and computes a variety of metrics while simulating each traversal therein to qualify the relationship between a site’s structure and the cumulative effect of support for the transformation in a site. We employed this toolkit in two websites. The results indicate that the transformation enables users …
Capacity-Driven Pricing Mechanism In Special Service Industries, Lijian Chen, Suraj M. Alexander
Capacity-Driven Pricing Mechanism In Special Service Industries, Lijian Chen, Suraj M. Alexander
MIS/OM/DS Faculty Publications
We propose a capacity driven pricing mechanism for several service industries in which the customer behavior, the price demand relationship, and the competition are significantly distinct from other industries. According our observation, we found that the price demand relationship in these industries cannot be modeled by fitted curves; the customers would neither plan in advance nor purchase the service strategically; and the competition would be largely local. We analyze both risk neutral and risk aversion pricing models and conclude the proposed capacity driven model would be the optimal solution under mild assumptions. The resulting pricing mechanism has been implemented at …
Supporting Multiple Paths To Objects In Information Hierarchies: Faceted Classification, Faceted Search, And Symbolic Links, Saverio Perugini
Supporting Multiple Paths To Objects In Information Hierarchies: Faceted Classification, Faceted Search, And Symbolic Links, Saverio Perugini
Computer Science Faculty Publications
We present three fundamental, interrelated approaches to support multiple access paths to each terminal object in information hierarchies: faceted classification, faceted search, and web directories with embedded symbolic links. This survey aims to demonstrate how each approach supports users who seek information from multiple perspectives. We achieve this by exploring each approach, the relationships between these approaches, including tradeoffs, and how they can be used in concert, while focusing on a core set of hypermedia elements common to all. This approach provides a foundation from which to study, understand, and synthesize applications which employ these techniques. This survey does not …
Mining Data From Multiple Software Development Projects, Huanjing Wang, Taghi M. Khoshgoftaar, Kehan Gao, Naeem Seliya
Mining Data From Multiple Software Development Projects, Huanjing Wang, Taghi M. Khoshgoftaar, Kehan Gao, Naeem Seliya
Computer Science Faculty Publications
A large system often goes through multiple software project development cycles, in part due to changes in operation and development environments. For example, rapid turnover of the development team between releases can influence software quality, making it important to mine software project data over multiple system releases when building defect predictors. Data collection of software attributes are often conducted independent of the quality improvement goals, leading to the availability of a large number of attributes for analysis. Given the problems associated with variations in development process, data collection, and quality goals from one release to another emphasizes the importance of …
High-Dimensional Software Engineering Data And Feature Selection, Huanjing Wang, Taghi M. Khoshgoftaar, Kehan Gao
High-Dimensional Software Engineering Data And Feature Selection, Huanjing Wang, Taghi M. Khoshgoftaar, Kehan Gao
Computer Science Faculty Publications
Software metrics collected during project development play a critical role in software quality assurance. A software practitioner is very keen on learning which software metrics to focus on for software quality prediction. While a concise set of software metrics is often desired, a typical project collects a very large number of metrics. Minimal attention has been devoted to finding the minimum set of software metrics that have the same predictive capability as a larger set of metrics – we strive to answer that question in this paper. We present a comprehensive comparison between seven commonly-used filter-based feature ranking techniques (FRT) …
Temporal Data Classification Using Linear Classifiers, Peter Revesz, Thomas Triplet
Temporal Data Classification Using Linear Classifiers, Peter Revesz, Thomas Triplet
School of Computing: Conference and Workshop Papers
Data classification is usually based on measurements recorded at the same time. This paper considers temporal data classification where the input is a temporal database that describes measurements over a period of time in history while the predicted class is expected to occur in the future. We describe a new temporal classification method that improves the accuracy of standard classification methods. The benefits of the method are tested on weather forecasting using the meteorological database from the Texas Commission on Environmental Quality.
Robust Lifetime Measurement In Large-Scale P2p Systems With Non-Stationary Arrivals, Xiaoming Wang, Zhongmei Yao, Yueping Zhang, Dmitri Loguinov
Robust Lifetime Measurement In Large-Scale P2p Systems With Non-Stationary Arrivals, Xiaoming Wang, Zhongmei Yao, Yueping Zhang, Dmitri Loguinov
Computer Science Faculty Publications
Characterizing user churn has become an important topic in studying P2P networks, both in theoretical analysis and system design. Recent work has shown that direct sampling of user lifetimes may lead to certain bias (arising from missed peers and round-off inconsistencies) and proposed a technique that estimates lifetimes based on sampled residuals. In this paper, however, we show that under non-stationary arrivals, which are often present in real systems, residual-based sampling does not correctly reconstruct user lifetimes and suffers a varying degree of bias, which in some cases makes estimation completely impossible. We overcome this problem using two contributions: a …
An Empirical Investigation Of Filter Attribute Selection Techniques For Software Quality Classification, Kehan Gao, Taghi M. Khoshgoftaar, Huanjing Wang
An Empirical Investigation Of Filter Attribute Selection Techniques For Software Quality Classification, Kehan Gao, Taghi M. Khoshgoftaar, Huanjing Wang
Computer Science Faculty Publications
Attribute selection is an important activity in data preprocessing for software quality modeling and other data mining problems. The software quality models have been used to improve the fault detection process. Finding faulty components in a software system during early stages of software development process can lead to a more reliable final product and can reduce development and maintenance costs. It has been shown in some studies that prediction accuracy of the models improves when irrelevant and redundant features are removed from the original data set. In this study, we investigated four filter attribute selection techniques, Automatic Hybrid Search (AHS), …
Open Forum: The Future Of Library Systems, Maria Collins, Andrée J. Rathemacher
Open Forum: The Future Of Library Systems, Maria Collins, Andrée J. Rathemacher
Technical Services Faculty Publications
Moderated by Maria Collins of North Carolina State University, discussion at this open forum on the future of library systems touched on open-source library systems, cloud computing, new initiatives by the Open Library Environment (OLE) Project and OCLC, and desired characteristics of future integrated library systems. Most participants had limited experience with next-generation library systems and attended the open forum with the desire to broaden their understanding, although some were exposed to or had worked with the open-source discovery tool VuFind, the OLE Project, WorldCat Local, and the OCLC Web-scale service. A strong desire to customize library systems to meet …
Residual-Based Estimation Of Peer And Link Lifetimes In P2p Networks, Xiaoming Wang, Zhongmei Yao, Dmitri Loguinov
Residual-Based Estimation Of Peer And Link Lifetimes In P2p Networks, Xiaoming Wang, Zhongmei Yao, Dmitri Loguinov
Computer Science Faculty Publications
Existing methods of measuring lifetimes in P2P systems usually rely on the so-called Create-BasedMethod (CBM), which divides a given observation window into two halves and samples users ldquocreatedrdquo in the first half every Delta time units until they die or the observation period ends. Despite its frequent use, this approach has no rigorous accuracy or overhead analysis in the literature. To shed more light on its performance, we first derive a model for CBM and show that small window size or large Delta may lead to highly inaccurate lifetime distributions. We then show that create-based sampling exhibits an inherent …
Node Isolation Model And Age-Based Neighbor Selection In Unstructured P2p Networks, Zhongmei Yao, Derek Leonard, Dmitri Loguinov
Node Isolation Model And Age-Based Neighbor Selection In Unstructured P2p Networks, Zhongmei Yao, Derek Leonard, Dmitri Loguinov
Computer Science Faculty Publications
Previous analytical studies of unstructured P2P resilience have assumed exponential user lifetimes and only considered age-independent neighbor replacement. In this paper, we overcome these limitations by introducing a general node-isolation model for heavy-tailed user lifetimes and arbitrary neighbor-selection algorithms. Using this model, we analyze two age-biased neighbor-selection strategies and show that they significantly improve the residual lifetimes of chosen users, which dramatically reduces the probability of user isolation and graph partitioning compared with uniform selection of neighbors. In fact, the second strategy based on random walks on age-proportional graphs demonstrates that, for lifetimes with infinite variance, the system monotonically increases …
User Interface Design, Moritz Stefaner, Sebastien Ferre, Saverio Perugini, Jonathan Koren, Yi Zhang
User Interface Design, Moritz Stefaner, Sebastien Ferre, Saverio Perugini, Jonathan Koren, Yi Zhang
Computer Science Faculty Publications
As detailed in Chap. 1, system implementations for dynamic taxonomies and faceted search allow a wide range of query possibilities on the data. Only when these are made accessible by appropriate user interfaces, the resulting applications can support a variety of search, browsing and analysis tasks. User interface design in this area is confronted with specific challenges. This chapter presents an overview of both established and novel principles and solutions.
Exploring Out-Of-Turn Interactions With Websites, Saverio Perugini, Naren Ramakrishnan, Manuel A. Pérez-Quiñones, Mary E. Pinney, Mary Beth Rosson
Exploring Out-Of-Turn Interactions With Websites, Saverio Perugini, Naren Ramakrishnan, Manuel A. Pérez-Quiñones, Mary E. Pinney, Mary Beth Rosson
Computer Science Faculty Publications
Hierarchies are ubiquitous on the web for structuring online catalogs and indexing multidimensional attributed data sets. They are a natural metaphor for information seeking if their levelwise structure mirrors the user's conception of the underlying domain. In other cases, they can be frustrating, especially if multiple drill‐downs are necessary to arrive at information of interest. To support a broad range of users, site designers often expose multiple faceted classifications or provide within‐page pruning mechanisms. We present a new technique, called out-of-turn interaction, that increases the richness of user interaction at hierarchical sites, without enumerating all possible completion paths in the …
On Static And Dynamic Partitioning Behavior Of Large-Scale Networks, Zhongmei Yao, Derek Leonard, Xiaoming Wang, Dmitri Loguinov
On Static And Dynamic Partitioning Behavior Of Large-Scale Networks, Zhongmei Yao, Derek Leonard, Xiaoming Wang, Dmitri Loguinov
Computer Science Faculty Publications
In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affect the resilience of such graphs. We start by applying classical results from random graph theory to show that a large variety of deterministic and random P2P graphs almost surely (i.e., with probability 1 − o(1)) remain connected under random failure if and only if they have no isolated nodes. This simple, yet powerful, result subsequently allows us to derive in closed-form the probability that a P2P network develops isolated nodes, and …
Link Lifetimes And Randomized Neighbor Selection In Dhts, Zhongmei Yao, Dmitri Loguinov
Link Lifetimes And Randomized Neighbor Selection In Dhts, Zhongmei Yao, Dmitri Loguinov
Computer Science Faculty Publications
Several models of user churn, resilience, and link lifetime have recently appeared in the literature [12], [13], [34], [35]; however, these results do not directly apply to classical Distributed Hash Tables (DHTs) in which neighbor replacement occurs not only when current users die, but also when new user arrive into the system, and where replacement choices are often restricted to the successor of the failed zone in the DHT space. To understand neighbor churn in such networks, this paper proposes a simple, yet accurate, model for capturing link dynamics in structured P2P systems and obtains the distribution of link lifetimes …
Symbolic Links In The Open Directory Project, Saverio Perugini
Symbolic Links In The Open Directory Project, Saverio Perugini
Computer Science Faculty Publications
We present a study to develop an improved understanding of symbolic links in web directories. A symbolic link is a hyperlink that makes a directed connection from a web page along one path through a directory to a page along another path. While symbolic links are ubiquitous in web directories such as Yahoo!, they are under-studied, and as a result, their uses are poorly understood. A cursory analysis of symbolic links reveals multiple uses: to provide navigational shortcuts deeper into a directory, backlinks to more general categories, and multiclassification. We investigated these uses in the Open Directory Project (ODP), the …
Volume And Cost Implications Of Product Portfolio Complexity, Mark A. Jacobs
Volume And Cost Implications Of Product Portfolio Complexity, Mark A. Jacobs
MIS/OM/DS Faculty Publications
Business leaders are concerned about the impacts of increasing levels of product portfolio complexity since many sense that complexity related costs such as order management, procurement, and inventory threaten to undermine operational efficiencies and consume profits. Even so, managers do not fully understand the extent and breadth of the impacts of product portfolio complexity. A more complete understanding of the operational effects of product portfolio complexity is lacking partially because researchers have not yet offered a robust theoretical perspective or studied it in a focused controlled way; until now. Herein, measures of product portfolio complexity are developed and related to …
Product Complexity: A Definition And Impacts On Operations, Mark A. Jacobs
Product Complexity: A Definition And Impacts On Operations, Mark A. Jacobs
MIS/OM/DS Faculty Publications
The difficulty for organizations arises because neither complexity nor its impacts on performance are well understood (Fisher & Ittner, 1999b). The mechanisms through which it affects cost, quality, delivery, and flexibility need to be explained (Ramdas, 2003). However, this cannot happen until complexity can be explained theoretically. But, to build theory there must first be a common understanding about the construct of interest (Wacker, 2004). Only then can researchers operationalize it and search for meaningful relationships. In light of this, I develop a definition of complexity below. A sampling of the operations management literature is then presented within the context …
Residual-Based Measurement Of Peer And Link Lifetimes In Gnutella Networks, Xiaoming Wang, Zhongmei Yao, Dmitri Loguinov
Residual-Based Measurement Of Peer And Link Lifetimes In Gnutella Networks, Xiaoming Wang, Zhongmei Yao, Dmitri Loguinov
Computer Science Faculty Publications
Existing methods of measuring lifetimes in P2P systems usually rely on the so-called create-based method (CBM), which divides a given observation window into two halves and samples users "created" in the first half every Delta time units until they die or the observation period ends. Despite its frequent use, this approach has no rigorous accuracy or overhead analysis in the literature. To shed more light on its performance, we flrst derive a model for CBM and show that small window size or large Delta may lead to highly inaccurate lifetime distributions. We then show that create-based sampling exhibits an inherent …
On Node Isolation Under Churn In Unstructured P2p Networks With Heavy-Tailed Lifetimes, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
On Node Isolation Under Churn In Unstructured P2p Networks With Heavy-Tailed Lifetimes, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
Computer Science Faculty Publications
Previous analytical studies [12], [18] of unstructured P2P resilience have assumed exponential user lifetimes and only considered age-independent neighbor replacement. In this paper, we overcome these limitations by introducing a general node-isolation model for heavy-tailed user lifetimes and arbitrary neighbor-selection algorithms. Using this model, we analyze two age-biased neighbor-selection strategies and show that they significantly improve the residual lifetimes of chosen users, which dramatically reduces the probability of user isolation and graph partitioning compared to uniform selection of neighbors. In fact, the second strategy based on random walks on age-weighted graphs demonstrates that for lifetimes with infinite variance, the system …
A Study Of Out-Of-Turn Interaction In Menu-Based, Ivr, Voicemail Systems, Saverio Perugini, Taylor J. Anderson, William F. Moroney
A Study Of Out-Of-Turn Interaction In Menu-Based, Ivr, Voicemail Systems, Saverio Perugini, Taylor J. Anderson, William F. Moroney
Computer Science Faculty Publications
We present the first user study of out-of-turn interaction in menu-based, interactive voice-response systems. Out-ofturn interaction is a technique which empowers the user (unable to respond to the current prompt) to take the conversational initiative by supplying information that is currently unsolicited, but expected later in the dialog. The technique permits the user to circumvent any flows of navigation hardwired into the design and navigate the menus in a manner which reflects their model of the task. We conducted a laboratory experiment to measure the effect of the use of outof- turn interaction on user performance and preference in a …
Modeling Heterogeneous User Churn And Local Resilience Of Unstructured P2p Networks, Zhongmei Yao, Derek Leonard, Dmitri Loguinov, Xiaoming Wang
Modeling Heterogeneous User Churn And Local Resilience Of Unstructured P2p Networks, Zhongmei Yao, Derek Leonard, Dmitri Loguinov, Xiaoming Wang
Computer Science Faculty Publications
Previous analytical results on the resilience of unstructured P2P systems have not explicitly modeled heterogeneity of user churn (i.e., difference in online behavior) or the impact of in-degree on system resilience. To overcome these limitations, we introduce a generic model of heterogeneous user churn, derive the distribution of the various metrics observed in prior experimental studies (e.g., lifetime distribution of joining users, joint distribution of session time of alive peers, and residual lifetime of a randomly selected user), derive several closed-form results on the transient behavior of in-degree, and eventually obtain the joint in/out degree isolation probability as a simple …
Interacting With Web Hierarchies, Saverio Perugini, Naren Ramakrishnan
Interacting With Web Hierarchies, Saverio Perugini, Naren Ramakrishnan
Computer Science Faculty Publications
Web site interfaces are a particularly good fit for hierarchies in the broadest sense of that idea, i.e. a classification with multiple attributes, not necessarily a tree structure. Several adaptive interface designs are emerging that support flexible navigation orders, exposing and exploring dependencies, and procedural information-seeking tasks. This paper provides a context and vocabulary for thinking about hierarchical Web sites and their design. The paper identifies three features that interface to information hierarchies. These are flexible navigation orders, the ability to expose and explore dependencies, and support for procedural tasks. A few examples of these features are also provided
Realtime Query Expansion And Procedural Interfaces For Information Hierarchies, Saverio Perugini
Realtime Query Expansion And Procedural Interfaces For Information Hierarchies, Saverio Perugini
Computer Science Faculty Publications
We demonstrate the use of two user interfaces for interacting with web hierarchies. One uses the dependencies underlying a hierarchy to perform real-time query expansion and, in this way, acts as an in situ feedback mechanism. The other enables the user to cascade the output from one interaction to the input of another, and so on, and, in this way, supports procedural information-seeking tasks without disrupting the flow of interaction.