Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Wright State University (632)
- The Texas Medical Center Library (43)
- New Jersey Institute of Technology (31)
- Old Dominion University (22)
- University of Kentucky (20)
-
- University of Nebraska - Lincoln (19)
- University of Nebraska at Omaha (18)
- City University of New York (CUNY) (15)
- Wayne State University (14)
- University of Missouri, St. Louis (11)
- Singapore Management University (9)
- San Jose State University (8)
- University of Texas at El Paso (6)
- Brigham Young University (5)
- LSU New Orleans (5)
- Loyola University Chicago (5)
- University of South Florida (5)
- Louisiana Tech University (4)
- Missouri University of Science and Technology (4)
- Nova Southeastern University (4)
- University of Louisville (4)
- University of Massachusetts Boston (4)
- Virginia Commonwealth University (4)
- California Polytechnic State University, San Luis Obispo (3)
- Central Washington University (3)
- Chinese Academy of Sciences (3)
- Dartmouth College (3)
- Karbala International Journal of Modern Science (3)
- Kennesaw State University (3)
- Munster Technological University (3)
- Keyword
-
- Semantic Web (46)
- Bioinformatics (42)
- Machine learning (28)
- Ontology (27)
- Humans (26)
-
- Machine Learning (23)
- Semantic Sensor Web (22)
- Deep learning (20)
- Twitter (15)
- Artificial intelligence (14)
- RDF (14)
- Artificial Intelligence (12)
- Clustering (12)
- Social Media (12)
- SSW (11)
- Deep Learning (10)
- Algorithms (9)
- Data mining (9)
- Ontologies (9)
- Semantic Analytics (9)
- Semantic Web Services (8)
- Linked Data (7)
- SAWSDL (7)
- Semantic web (7)
- Semantics (7)
- Social Networks (7)
- Cloud Computing (6)
- Computational Biology (6)
- Computer science (6)
- Correlation networks (6)
- Publication Year
- Publication
-
- Kno.e.sis Publications (540)
- Computer Science and Engineering Faculty Publications (91)
- Faculty, Staff and Student Publications (42)
- Theses (30)
- Computer Science Theses & Dissertations (15)
-
- Wayne State University Dissertations (11)
- Computer Science Faculty Publications (9)
- Research Collection School Of Computing and Information Systems (9)
- Interdisciplinary Informatics Faculty Proceedings & Presentations (8)
- Dissertations (7)
- Theses and Dissertations--Computer Science (7)
- Chemistry & Biochemistry Faculty Works (6)
- Open Educational Resources (6)
- School of Computing: Dissertations, Theses, and Student Research (6)
- Doctoral Dissertations (5)
- Electronic Theses and Dissertations (5)
- Open Access Theses & Dissertations (5)
- Publications and Research (5)
- USF Tampa Graduate Theses and Dissertations (5)
- CCAC Theses and Dissertations (4)
- Dissertations, Theses, and Capstone Projects (4)
- Faculty Publications (4)
- Faculty Publications, Computer Science (4)
- LSU New Orleans Theses and Dissertations (4)
- Master's Projects (4)
- Master's Theses (4)
- School of Computing: Faculty Publications (4)
- Theses and Dissertations (4)
- Bulletin of Chinese Academy of Sciences (Chinese Version) (3)
- Computer Science Faculty Proceedings & Presentations (3)
- Publication Type
- File Type
Articles 721 - 750 of 985
Full-Text Articles in Computer Sciences
Spatiotemporal And Thematic Semantic Analytics, Matthew Perry
Spatiotemporal And Thematic Semantic Analytics, Matthew Perry
Kno.e.sis Publications
No abstract provided.
Towards Attack-Resilient Geometric Data Perturbation, Keke Chen, Ling Liu
Towards Attack-Resilient Geometric Data Perturbation, Keke Chen, Ling Liu
Kno.e.sis Publications
Data perturbation is a popular technique for privacy-preserving data mining. The major challenge of data perturbation is balancing privacy protection and data quality, which are normally considered as a pair of contradictive factors. We propose that selectively preserving only the task/model specific information in perturbation would improve the balance. Geometric data perturbation, consisting of random rotation perturbation, random translation perturbation, and noise addition, aims at preserving the important geometric properties of a multidimensional dataset, while providing better privacy guarantee for data classification modeling. The preliminary study has shown that random geometric perturbation can well preserve model accuracy for several popular …
Mining Minimal Distinguishing Subsequence Patterns With Gap Constraints, Xiaonan Ji, James Bailey, Guozhu Dong
Mining Minimal Distinguishing Subsequence Patterns With Gap Constraints, Xiaonan Ji, James Bailey, Guozhu Dong
Kno.e.sis Publications
Discovering contrasts between collections of data is an important task in data mining. In this paper, we introduce a new type of contrast pattern, called a Minimal Distinguishing Subsequence (MDS). An MDS is a minimal subsequence that occurs frequently in one class of sequences and infrequently in sequences of another class. It is a natural way of representing strong and succinct contrast information between two sequential datasets and can be useful in applications such as protein comparison, document comparison and building sequential classification models. Mining MDS patterns is a challenging task and is significantly different from mining contrasts between relational/transactional …
Experiences With Tracking The Effects Of Changing Requirements On Morphbank: A Web-Based Bioinformatics Application, Subhajit Datta, Robert Van Engelen, David Gaitros, Neelima Jammigumpula
Experiences With Tracking The Effects Of Changing Requirements On Morphbank: A Web-Based Bioinformatics Application, Subhajit Datta, Robert Van Engelen, David Gaitros, Neelima Jammigumpula
Research Collection School Of Computing and Information Systems
In this paper, we present a case study of applying the metrics Mutation Index, Component Set, Dependency Index on Morphbank- a web based bioinformatics application - to track the effects of changing requirements on a software system and suggest design modifications to mitigate such impact. Morphbank is "an open web repository of biological images documenting specimen-based research in comparative anatomy, morphological phylogenetics, taxonomy and related fields focused on increasing our knowledge about biodiversity". This paper discusses the context of the case study, analyzes the results, highlights observations and learning, and mentions directions of future work.
A Day In The Life Of Pubmed: Analysis Of A Typical Day's Query Log, Jorge R Herskovic, Len Y Tanaka, William Hersh, Elmer V Bernstam
A Day In The Life Of Pubmed: Analysis Of A Typical Day's Query Log, Jorge R Herskovic, Len Y Tanaka, William Hersh, Elmer V Bernstam
Faculty, Staff and Student Publications
OBJECTIVE: To characterize PubMed usage over a typical day and compare it to previous studies of user behavior on Web search engines. DESIGN: We performed a lexical and semantic analysis of 2,689,166 queries issued on PubMed over 24 consecutive hours on a typical day. MEASUREMENTS: We measured the number of queries, number of distinct users, queries per user, terms per query, common terms, Boolean operator use, common phrases, result set size, MeSH categories, used semantic measurements to group queries into sessions, and studied the addition and removal of terms from consecutive queries to gauge search strategies. RESULTS: The size of …
Automatic Composition Of Semantic Web Services Using Process And Data Mediation, Zixin Wu, Ajith H. Ranabahu, Karthik Gomadam, Amit P. Sheth, John A. Miller
Automatic Composition Of Semantic Web Services Using Process And Data Mediation, Zixin Wu, Ajith H. Ranabahu, Karthik Gomadam, Amit P. Sheth, John A. Miller
Kno.e.sis Publications
Web service composition has quickly become a key area of research in the services oriented architecture community. One of the challenges in composition is the existence of heterogeneities across independently created and autonomously managed Web service requesters and Web service providers. Previous work in this area either involved significant human effort or in cases of the efforts seeking to provide largely automated approaches, overlooked the problem of data heterogeneities, resulting in partial solutions that would not support executable workflow for real-world problems. In this paper, we present a planning-based approach to solve both the process heterogeneity and data heterogeneity problems. …
Engineering Mathematics Education At Wright State University: Uncorking The First Year Bottleneck, Nathan W. Klingbeil, Kuldip S. Rattan, Michael L. Raymer, David B. Reynolds, Richard Mercer
Engineering Mathematics Education At Wright State University: Uncorking The First Year Bottleneck, Nathan W. Klingbeil, Kuldip S. Rattan, Michael L. Raymer, David B. Reynolds, Richard Mercer
Kno.e.sis Publications
No abstract provided.
Survey Of Current Sensor Network Data Management Frameworks, Cory Henson, Satya S. Sahoo
Survey Of Current Sensor Network Data Management Frameworks, Cory Henson, Satya S. Sahoo
Kno.e.sis Publications
No abstract provided.
Finding Molecular Complexes Through Multiple Layer Clustering Of Protein Interaction Networks, Bill Andreopoulos, Aijun An, Xiangji Huang, Xiaogang Wang
Finding Molecular Complexes Through Multiple Layer Clustering Of Protein Interaction Networks, Bill Andreopoulos, Aijun An, Xiangji Huang, Xiaogang Wang
Faculty Publications, Computer Science
Clustering protein-protein interaction networks (PINs) helps to identify complexes that guide the cell machinery. Clustering algorithms often create a flat clustering, without considering the layered structure of PINs. We propose the MULIC clustering algorithm that produces layered clusters. We applied MULIC to five PINs. Clusters correlate with known MIPS protein complexes. For example, a cluster of 79 proteins overlaps with a known complex of 88 proteins. Proteins in top cluster layers tend to be more representative of complexes than proteins in bottom layers. Lab work on finding unknown complexes or determining drug effects can be guided by top layer proteins.
Semantically Annotating A Web Service, Kunal Verma, Amit P. Sheth
Semantically Annotating A Web Service, Kunal Verma, Amit P. Sheth
Kno.e.sis Publications
In the past few years, service-oriented architecture (SOA) has transitioned from a partially formed vision into a widely implemented paradigm, with Web services (WS) being the forerunners to implementing SOA-based solutions. But even though the current trend is to use Web services' standards-based nature to establish static connections between various components, businesses are starting to explore dynamic value-added propositions, such as reuse, interoperability, and agility.
Role Of Semantics In Autonomic & Adaptive Web Services And Processes, Amit P. Sheth
Role Of Semantics In Autonomic & Adaptive Web Services And Processes, Amit P. Sheth
Kno.e.sis Publications
The emergence of Service Oriented Architectures (SOA) has created a new paradigm of loosely coupled distributed systems. In the METEOR-S project, we have studied the comprehensive role of semantics in all stages of the life cycle of service and process-- including annotation, publication, discovery, interoperability/data mediation, and composition. In 2002-2003, we had offered a broad framework of semantics consisting of four types:1) Data semantics, 2) Functional semantics, 3) Non-Functional semantics and 4) Execution semantics. This talk describes the need for the four types of semantics, its standards-based support through WSDL-S/SAWSDL, and the need for such semantic representation to dynamic and …
Data Integration, Meenakshi Nagarajan
Glycoo Ontology, Christopher Thomas
Learning To Model Spatial Dependency: Semi-Supervised Discriminative Random Fields, Chi-Hoon Lee, Shaojun Wang, Feng Jiao, Dale Schuurmans, Russell Greiner
Learning To Model Spatial Dependency: Semi-Supervised Discriminative Random Fields, Chi-Hoon Lee, Shaojun Wang, Feng Jiao, Dale Schuurmans, Russell Greiner
Kno.e.sis Publications
We present a novel, semi-supervised approach to training discriminative random fields (DRFs) that efficiently exploits labeled and unlabeled training data to achieve improved accuracy in a variety of image processing tasks. We formulate DRF training as a form of MAP estimation that combines conditional loglikelihood on labeled data, given a data-dependent prior, with a conditional entropy regularizer defined on unlabeled data. Although the training objective is no longer concave, we develop an efficient local optimization procedure that produces classifiers that are more accurate than ones based on standard supervised DRF training. We then apply our semi-supervised approach to train DRFs …
Beyond Sawsdl - A Game Plan For Broader Adoption Of Semantic Web Services, Amit P. Sheth
Beyond Sawsdl - A Game Plan For Broader Adoption Of Semantic Web Services, Amit P. Sheth
Kno.e.sis Publications
After a flurry of research activities led by the OWL-S, WSMO, SWSF, and WSDL-S groups, we now have taken the first concrete steps toward building a Semantic Web Services (SWS) based solution, in the form of a W3C candidate recommendation SAWSDL [http://www.w3.org/2002/ws/sawsdl/], associated tools and use cases, and initial applications [1]. Where do we go from here? Researchers among us may be fully convinced of the importance and benefit of adding semantics to Web services and impatient to see their research translated into technologies and adapted for real use. However, I believe we may need to be patient and do …
A Unified Approach To Retrieving Web Documents And Semantic Web Data, Trivikram Immaneni, Krishnaprasad Thirunarayan
A Unified Approach To Retrieving Web Documents And Semantic Web Data, Trivikram Immaneni, Krishnaprasad Thirunarayan
Kno.e.sis Publications
The Semantic Web seems to be evolving into a property-linked web of RDF data, conceptually divorced from (but physically housed in) the hyperlinked web of HTML documents. We discuss the Unified Web model that integrates the two webs and formalizes the structure and the semantics of interconnections between them. We also discuss the Hybrid Query Language which combines the Data and Information Retrieval techniques to provide a convenient and uniform way to retrieve data and documents from the Unified Web. We present the retrieval system SITAR and some preliminary results.
Schema-Driven Relationship Extraction From Unstructured Text, Cartic Ramakrishnan
Schema-Driven Relationship Extraction From Unstructured Text, Cartic Ramakrishnan
Kno.e.sis Publications
No abstract provided.
Sensor Networks Survey, Cory Andrew Henson, Satya S. Sahoo
Sensor Networks Survey, Cory Andrew Henson, Satya S. Sahoo
Kno.e.sis Publications
No abstract provided.
Glycomics Project Overview, Satya S. Sahoo
Glycomics Project Overview, Satya S. Sahoo
Kno.e.sis Publications
No abstract provided.
Sa-Rest: Semantically Interoperable And Easier-To-Use Services And Mashups, Amit P. Sheth, Karthik Gomadam, Jonathan Lathem
Sa-Rest: Semantically Interoperable And Easier-To-Use Services And Mashups, Amit P. Sheth, Karthik Gomadam, Jonathan Lathem
Kno.e.sis Publications
Services based on the representational state transfer (REST) paradigm, a lightweight implementation of a service-oriented architecture, have found even greater success than their heavyweight siblings, which are based on the Web Services Description Language (WSDL.) and SOAP. By using XML-based messaging, RESTful services can bring together discrete data from different services to create meaningful data sets; mashups such as these are extremely popular today.
Measuring Inconsistency For Description Logics Based On Paraconsistent Semantics, Yue Ma, Guilin Qi, Pascal Hitzler, Zuoquan Li
Measuring Inconsistency For Description Logics Based On Paraconsistent Semantics, Yue Ma, Guilin Qi, Pascal Hitzler, Zuoquan Li
Computer Science and Engineering Faculty Publications
In this paper, we present an approach for measuring inconsistency in a knowledge base. We first define the degree of inconsistency using a four-valued semantics for the description logic ALC. Then an ordering over knowledge bases is given by considering their inconsistency degrees. Our measure of inconsistency can provide important information for inconsistency handling.
Semantic Matchmaking Of Web Resources With Local Closed-World Reasoning, Stephan Grimm, Pascal Hitzler
Semantic Matchmaking Of Web Resources With Local Closed-World Reasoning, Stephan Grimm, Pascal Hitzler
Computer Science and Engineering Faculty Publications
Ontology languages like OWL allow for semantically rich annotation of resources (e.g., products advertised at on-line electronic marketplaces). The description logic (DL) formalism underlying OWL provides reasoning techniques that perform match-making on such annotations. This paper identifies peculiarities in the use of DL inferences for matchmaking that derive from OWL's open-world semantics, analyzes local closed-world reasoning for its applicability to matchmaking, and investigates the suitability of two nonmonotonic extensions to DL, autoepistemic DLs and DLs with circumscription, for local closed-world reasoning in the matchmaking context. An elaborate example of an electronic marketplace for PC product catalogs from the e-commerce domain …
From “Glycosyltransferase” To “Congenital Muscular Dystrophy”: Integrating Knowledge From Ncbi Entrez Gene And The Gene Ontology, Satya S. Sahoo, Kelly Zeng, Olivier Bodenreider, Amit P. Sheth
From “Glycosyltransferase” To “Congenital Muscular Dystrophy”: Integrating Knowledge From Ncbi Entrez Gene And The Gene Ontology, Satya S. Sahoo, Kelly Zeng, Olivier Bodenreider, Amit P. Sheth
Kno.e.sis Publications
Entrez Gene (EG), Online Mendelian Inheritance in Man (OMIM) and the Gene Ontology (GO) are three complementary knowledge resources that can be used to correlate genomic data with disease information. However, bridging between genotype and phenotype through these resources currently requires manual effort or the development of customized software. In this paper, we argue that integrating EG and GO provides a robust and flexible solution to this problem. We demonstrate how the Resource Description Framework (RDF) developed for the Semantic Web can be used to represent and integrate these resources and enable seamless access to them as a unified resource. …
What, Where And When: Supporting Semantic, Spatial And Temporal Queries In A Dbms, Matthew Perry, Amit P. Sheth, Farshad Hakimpour, Prateek Jain
What, Where And When: Supporting Semantic, Spatial And Temporal Queries In A Dbms, Matthew Perry, Amit P. Sheth, Farshad Hakimpour, Prateek Jain
Kno.e.sis Publications
Spatial and temporal data are critical components in many applications. This is especially true in analytical domains such as national security and criminal investigation. The outcome of the analytical process in these applications often hinges on uncovering and analyzing complex relationships between disparate people, places and events. Fundamentally new query operators based on the graph structure of Semantic Web data models, such as semantic associations, are proving useful in these applications. However, these analysis mechanisms are primarily intended for thematic relationships. We describe a framework built around the RDF metadata model for analysis of thematic, spatial and temporal relationships between …
Collecting Expertise Of Researchers For Finding Relevant Experts In A Peer-Review Setting, Delroy H. Cameron, Boanerges Aleman-Meza, Ismailcem Budak Arpinar
Collecting Expertise Of Researchers For Finding Relevant Experts In A Peer-Review Setting, Delroy H. Cameron, Boanerges Aleman-Meza, Ismailcem Budak Arpinar
Kno.e.sis Publications
We present ideas for determining the expertise of researchers across various areas of computer science and for finding relevant experts/reviewers in a peer review setting. We explain how Semantic Web techniques for data collection and data representation using ontologies can be used in addressing this specific 'ExpertFinder' problem.
Brief Announcement: Space Adaptation: Privacy-Preserving Multiparty Collaborative Mining With Geometric Perturbation, Keke Chen, Ling Liu
Brief Announcement: Space Adaptation: Privacy-Preserving Multiparty Collaborative Mining With Geometric Perturbation, Keke Chen, Ling Liu
Kno.e.sis Publications
No abstract provided.
Evolution And Maintenance Of Frequent Pattern Space When Transactions Are Removed, Mengling Feng, Guozhu Dong, Jinyan Li, Yap-Peng Tan, Limsoon Wong
Evolution And Maintenance Of Frequent Pattern Space When Transactions Are Removed, Mengling Feng, Guozhu Dong, Jinyan Li, Yap-Peng Tan, Limsoon Wong
Kno.e.sis Publications
This paper addresses the maintenance of discovered frequent patterns when a batch of transactions are removed from the original dataset. We conduct an in-depth investigation on how the frequent pattern space evolves under transaction removal updates using the concept of equivalence classes. Inspired by the evolution analysis, an effective and exact algorithm TRUM is proposed to maintain frequent patterns. Experimental results demonstrate that our algorithm outperforms representative state-of-the-art algorithms.
Regression Cubes With Lossless Compression And Aggregation, Yixin Chen, Guozhu Dong, Jiawei Han, Jian Pei, Benjamin W. Wah, Jianyong Wang
Regression Cubes With Lossless Compression And Aggregation, Yixin Chen, Guozhu Dong, Jiawei Han, Jian Pei, Benjamin W. Wah, Jianyong Wang
Kno.e.sis Publications
As OLAP engines are widely used to support multidimensional data analysis, it is desirable to support in data cubes advanced statistical measures, such as regression and filtering, in addition to the traditional simple measures such as count and average. Such new measures will allow users to model, smooth, and predict the trends and patterns of data. Existing algorithms for simple distributive and algebraic measures are inadequate for efficient computation of statistical measures in a multidimensional space. In this paper, we propose a fundamentally new class of measures, compressible measures, in order to support efficient computation of the statistical models. For …
Implicit Online Learning With Kernels, Li Cheng, S. V. N. Vishwanathan, Dale Schuurmans, Shaojun Wang, Terry Caelli
Implicit Online Learning With Kernels, Li Cheng, S. V. N. Vishwanathan, Dale Schuurmans, Shaojun Wang, Terry Caelli
Kno.e.sis Publications
We present two new algorithms for online learning in reproducing kernel Hilbert spaces. Our first algorithm, ILK (implicit online learning with kernels), employs a new, implicit update technique that can be applied to a wide variety of convex loss functions. We then introduce a bounded memory version, SILK (sparse ILK), that maintains a compact representation of the predictor without compromising solution quality, even in non-stationary environments. We prove loss bounds and analyze the convergence rate of both. Experimental evidence shows that our proposed algorithms outperform current methods on synthetic and real data.
{Ontology: Resource} X {Matching : Mapping} X {Schema : Instance} :: Components Of The Same Challenge, Amit P. Sheth
{Ontology: Resource} X {Matching : Mapping} X {Schema : Instance} :: Components Of The Same Challenge, Amit P. Sheth
Kno.e.sis Publications
Ontologies enable us to elevate syntactic and structural processing in an information system/Web to an information system/Web powered with semantic processing. Experience has shown that monolithic and tightly coupled approaches seldom succeed, and majority of information systems and applications will need to deal with plurality of ontologies in a loosely coupled environment (i.e., independently evolving ontologies and inter-ontology relationships, existence of different contexts for different users/applications etc.) Development of such loosely-coupled multi-ontology environments entails development of techniques for ontology mapping/alignment, multi-ontology query processing, and much more.