Robert B. Allen

dblp:a/RobertBAllen · also Robert Burnell Allen · DBLP profile ↗
← Back
29ranked-venue papers
16as first author
1since 2021 · last 2022
0000-0002-4059-2587ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 15 · 7 first-author · 1 since 2021Artificial intelligence and machine learning · 11 · 5 first-authorHuman-computer interaction and ubiquitous computing · 4 · 4 first-authorComputer networks · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorTheory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Speech recognition and synthesis · 25% Deep learning architectures and training · 25% Information extraction and text analysis · 25%
Human-computer interaction and pervasive computing
4 papers
Usability and user experience research · 37% User interface design and tools · 35% Interaction techniques and input · 24%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Hardware accelerators and domain-specific architectures · 47% Emerging computing paradigms · 32% Integrated circuit design · 21%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 16 heaviest of 18, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Speech recognition and synthesis › automatic speech recognition
phoneme recognition
0.011990
A Recurrent Neural Network for Word Identification from Continuous Phoneme Strings · NIPS 1990
Machine learning › Deep learning architectures and training
recurrent neural network
0.011990
A Recurrent Neural Network for Word Identification from Continuous Phoneme Strings · NIPS 1990
Natural language and speech › Information extraction and text analysis
sequence labeling
0.011990
A Recurrent Neural Network for Word Identification from Continuous Phoneme Strings · NIPS 1990
Machine learning › Learning paradigms
supervised learning
0.011990
Relaxation Networks for Large Supervised Learning Problems · NIPS 1990
User interface design and tools
user models
0.011990
User Models: Theory, Method, and Practice · Int. J. Man Mach. Stud. 1990
Hardware accelerators and domain-specific architectures › machine learning accelerator
neural network accelerator
0.011988
Performance of a Stochastic Learning Microchip · NIPS 1988
Emerging computing paradigms
neuromorphic computing
0.011987
Stochastic Learning Networks and their Electronic Implementation · NIPS 1987
Usability and user experience research › human performance modeling
keystroke-level model
0.011983
Details of Command-Language Keystrokes · ACM Trans. Inf. Syst. 1983
Interaction techniques and input
text entry
0.011983
Details of Command-Language Keystrokes · ACM Trans. Inf. Syst. 1983
Interaction techniques and input
voice interaction
0.011983
Composition and Editing of Spoken Letters · Int. J. Man Mach. Stud. 1983
Mathematical optimization
continuous optimization
0.011990
Relaxation Networks for Large Supervised Learning Problems · NIPS 1990
Integrated circuit design
digital circuit design
0.011988
Performance of a Stochastic Learning Microchip · NIPS 1988
Integrated circuit design
analog and mixed-signal circuits
0.011987
Stochastic Learning Networks and their Electronic Implementation · NIPS 1987
Hardware accelerators and domain-specific architectures
neural network implementation
0.011987
Stochastic Learning Networks and their Electronic Implementation · NIPS 1987
Usability and user experience research › cognitive modeling
cognitive models of interaction
0.011983
Details of Command-Language Keystrokes · ACM Trans. Inf. Syst. 1983
Collaborative and social computing
computer-mediated communication
0.011983
Composition and Editing of Spoken Letters · Int. J. Man Mach. Stud. 1983

Methods — techniques the papers use, named apart from their topics

relaxation · 0.0stochastic learning · 0.0theory · 0.0recurrent neural network · 0.0practice · 0.0method · 0.0latency and error analysis · 0.0keystroke-level model · 0.0controlled experiment · 0.0composition and editing · 0.0cognitive process modeling · 0.0
YearPublicationVenuePosition
2022 Implementation Issues for a Highly Structured Research Report
abstract
Abstract We have proposed that scientific research reports should be constructed entirely of structured knowledge rather than text. In an earlier paper, we emphasized Research Designs as a framework for structured research reports and described how a structured implementation might be applied to Pasteur’s classic swan-neck flask experiment. In this paper, we examine some of the issues encountered in developing that implementation using dynamic models. For instance, we consider issues associated with modeling state transitions.
Robert B. Allen
TPDL1
2016 Formal Representation of Socio-Legal Roles and Functions for the Description of History
Yoonmi Chu, Robert B. Allen
TPDL2
2016 The Impact of Different Teaching Approaches and Languages on Student Learning of Introductory Programming Concepts
abstract
Learning to program, especially in the object-oriented paradigm, is a difficult undertaking for many students. As a result, computing educators have tried a variety of instructional methods to assist beginning programmers. These include developing approaches geared specifically toward novices and experimenting with different introductory programming languages. However, determining the effectiveness of these interventions poses a problem. The research presented here developed an instrument to assess student learning of fundamental and object-oriented programming concepts, then used that instrument to investigate the impact of different teaching approaches and languages on university students’ ability to learn those concepts. Extensive data analysis showed that the instrument performed well overall. Reliability of the assessment tool was statistically satisfactory and content validity was supported by intrinsic characteristics, question response analysis, and expert review. Preliminary support for construct validity was provided through exploratory factor analysis. Three components that at least partly represented the construct “understanding of fundamental programming concepts” were identified: methods and functions, mathematical and logical expressions, and control structures. Analysis revealed significant differences in student performance based on instructional language and approach. The analyses showed differences on the overall score and questions involving assignment, mathematical and logical expressions, and code completion. Instructional language and approach did not appear to affect student performance on questions addressing object-oriented concepts.
Wanda M. Kunkle, Robert B. Allen
ACM Trans. Comput. Educ.2
2014 Active learning for text classification: Using the LSI Subspace Signature Model
abstract
Supervised learning methods rely on large sets of labeled training examples. However, large training sets are rare and making them is expensive. In this research, Latent Semantic Indexing Subspace Signature Model (LSISSM) is applied to labeling for active learning of unstructured text. Based on Singular Value Decomposition (SVD), LSISSM represents terms and documents as semantic signatures by the distribution of their local statistical contribution across the top-ranking LSI latent dimensions after dimension reduction. When utilized to an unlabeled text corpus, LSISSM finds the most important samples and terms according to their global statistical contribution ranking in the corresponding LSI subspaces without prior knowledge of labels or dependency to model-loss functions of the classifiers. These sample subsets also effectively maintain the sampling distribution of the whole corpus. Furthermore, tests demonstrate that the sample subsets with the optimized term subsets substantially improve the learning accuracy across three standard classifiers.
Weizhong Zhu, Robert B. Allen
DSAA2
2013 Document clustering using the LSI subspace signature model
abstract
We describe the latent semantic indexing subspace signature model (LSISSM) for semantic content representation of unstructured text. Grounded on singular value decomposition, the model represents terms and documents by the distribution signatures of their statistical contribution across the top‐ranking latent concept dimensions. LSISSM matches term signatures with document signatures according to their mapping coherence between latent semantic indexing (LSI) term subspace and LSI document subspace. LSISSM does feature reduction and finds a low‐rank approximation of scalable and sparse term‐document matrices. Experiments demonstrate that this approach significantly improves the performance of major clustering algorithms such as standard K‐means and self‐organizing maps compared with the vector space model and the traditional LSI model. The unique contribution ranking mechanism in LSISSM also improves the initialization of standard K‐means compared with random seeding procedure, which sometimes causes low efficiency and effectiveness of clustering. A two‐stage initialization strategy based on LSISSM significantly reduces the running time of standard K‐means procedures.
Weizhong Zhu, Robert B. Allen
J. Assoc. Inf. Sci. Technol.2
2012 Malleable Finding Aids
Scott R. Anderson, Robert B. Allen
TPDL2
2008 Analyzing the Propagation of Influence and Concept Evolution in Enterprise Social Networks through Centrality and Latent Semantic Analysis
Weizhong Zhu, Chaomei Chen, Robert B. Allen
PAKDD3
2007 Programming-lite: a dialog on educating computer science practitioners in a "flat world"
abstract
No abstract available.
Robert B. Allen, David Klappholz, Michael R. Wick, Carol Zander
SIGCSE1
2007 Integration of association rules and ontologies for semantic query expansion
Min Song 0001, Il-Yeol Song, Xiaohua Hu 0001, Robert B. Allen
Data Knowl. Eng.4
2005 Semantic Query Expansion Combining Association Rules with Ontologies and Information Retrieval Techniques
Min Song 0001, Il-Yeol Song, Xiaohua Hu 0001, Robert B. Allen
DaWaK4
2005 An Automatic Unsupervised Querying Algorithm for Efficient Information Extraction in Biomedical Domain
Min Song 0001, Il-Yeol Song, Xiaohua Hu 0001, Robert B. Allen
PAKDD4
2005 Metrics for the scope of a collection
abstract
Abstract Some collections cover many topics, while others are narrowly focused on a limited number of topics. We introduce the concept of the “scope” of a collection of documents and we compare two ways of measuring it. These measures are based on the distances between documents. The first uses the overlap of words between pairs of documents. The second measure uses a novel method that calculates the semantic relatedness to pairs of words from the documents. Those values are combined to obtain an overall distance between the documents. The main validation for the measures compared Web pages categorized by Yahoo. Sets of pages sampled from broad categories were determined to have a higher scope than sets derived from subcategories. The measure was significant and confirmed the expected difference in scope. Finally, we discuss other measures related to scope.
Robert B. Allen, Yejun Wu
J. Assoc. Inf. Sci. Technol.1
1999 Metadata and Data Structures for the Historical Newspaper Digital Library
abstract
We examine metadata and data-structure issues for the Historical Newspaper Digital Library. This project proposes to digitize and then do OCR and linguisting processing on several years worth of historical newspapers. Newspapers are very complex information objects so developing a rich description of their content is challenging. In addition to frameworks for the logical structure and physical layout, we propose metadata relevant to the image processing and to the historians who will use this collection. Finally, we consider how the metadata infrastructure might be managed as it evolves with improved text processing capabilities and how an infrastructure might be developed to support a community of users.
Robert B. Allen, John Schalow
CIKM1
1996 RAVE: Real-Time Services for the Web
Paul England, Robert B. Allen, Ron Underwood
Comput. Networks2
1994 Editorial
Robert B. Allen
ACM Trans. Inf. Syst.1
1991 Computer-Human Interaction and ACM TOIS - Editorial
Robert B. Allen
ACM Trans. Inf. Syst.1
1990 A recurrent neural network for word identification from phoneme sequences
Robert B. Allen, Candace A. Kamm, S. B. James
ICSLP1
1990 A Recurrent Neural Network for Word Identification from Continuous Phoneme Strings
Robert B. Allen, Candace A. Kamm
NIPS1
1990 Relaxation Networks for Large Supervised Learning Problems
Joshua Alspector, Robert B. Allen, Anthony Jayakumar, Torsten Zeppenfeld, Ron Meir
NIPS2
1990 User Models: Theory, Method, and Practice
Robert B. Allen
Int. J. Man Mach. Stud.1
1990 Learning of stable states in stochastic asymmetric networks
abstract
Boltzmann-based models with asymmetric connections are investigated. Although they are initially unstable, these networks spontaneously self-stabilize as a result of learning. Moreover, pairs of weights symmetrize during learning; however, the symmetry is not enough to account for the observed stability. To characterize the system it is useful to consider how its entropy is affected by learning and the entropy of the information stream. The stability of an asymmetric network is confirmed with an electronic model.
Robert B. Allen, Joshua Alspector
IEEE Trans. Neural Networks1
1989 Developing agent models with a neural reinforcement technique
abstract
A reinforcement training procedure was developed for sequential back-propagation networks and applied in several studies demonstrating interaction between agents in multiple-agent networks. In the first study, a network was trained to predict the next position of an agent which was moving in a complex pattern around the corners of a square. The network quickly learned to predict the position without error. In particular, the network may be said to have developed an agent or user model of the moving agent. In two additional studies, a joint contingency was applied to two agents and limited cooperation was developed between them. Overall, the results provide support for the application of neural networks in distributed AI (artificial intelligence).>
Robert B. Allen
SMC1
1989 A New Name - ACM Transactions on Information Systems, Editorial
Robert B. Allen
ACM Trans. Inf. Syst.1
1988 Performance of a Stochastic Learning Microchip
Joshua Alspector, Bhusan Gupta, Robert B. Allen
NIPS3
1988 Interacting and communicating connectionist agents
Robert B. Allen, Mark E. Riecken
Neural Networks1
1987 Stochastic Learning Networks and their Electronic Implementation
Joshua Alspector, Robert B. Allen, Victor Hu, Srinagesh Satyanarayana
NIPS2
1983 Composition and Editing of Spoken Letters
Robert B. Allen
Int. J. Man Mach. Stud.1
1983 Cognitive Factors in the Use of Menus and Trees: An Experiment
abstract
Users without prior computer experience employed a menu-and-tree interface to search a database relevant to telecommunications services. Detailed data were recorded on the latency of each response and whether an error was made. The depth, level, vertical position, number of options, and trial were found to significantly affect response latency. The level, content, and side of the screen on which the choice was displayed significantly affected error rate. The results of the experiment and additional issues in cognitive human factors are discussed.
Robert B. Allen
IEEE J. Sel. Areas Commun.1
1983 Details of Command-Language Keystrokes
abstract
KeystrokesThe Keystroke-Level Model asserts that the time for an expert to enter a task using a command language is a function of specific task-acquisition, mental, and motor-response times.The evidence for the model is critically reviewed, and new data are presented.The fit of the new data to the model is modest even when several modifications of the model are considered.It is proposed that a more complex model, based explicitly on cognitive processes, is necessary.
Robert B. Allen, M. W. Scerbo
ACM Trans. Inf. Syst.1