10
Research enabling other research Infinite graph (UTD) is the prerequisite for EL++ (RPI, HP), Expanded Visualization (UCSB) and Topic Modeling (UC Irvine, RPI) Workflow (Occulus, Cal), Ontology homogenization Infinite Graph Visualiza tion EL++ Topic Modeling Workflow

Research enabling other research Infinite graph (UTD) is the prerequisite for EL++ (RPI, HP), Expanded Visualization (UCSB) and Topic Modeling (UC Irvine,

Embed Size (px)

Citation preview

Page 1: Research enabling other research  Infinite graph (UTD) is the prerequisite for EL++ (RPI, HP), Expanded Visualization (UCSB) and Topic Modeling (UC Irvine,

Research enabling other research

Infinite graph (UTD) is the prerequisite for EL++ (RPI, HP), Expanded Visualization (UCSB) and Topic Modeling (UC Irvine, RPI)

Workflow (Occulus, Cal), Ontology homogenization

Infinite Graph Visualization EL++Topic ModelingWorkflow

Page 2: Research enabling other research  Infinite graph (UTD) is the prerequisite for EL++ (RPI, HP), Expanded Visualization (UCSB) and Topic Modeling (UC Irvine,

Entity Resolution Entity Resolution (UMass) is the

prerequisite for all research and large flows

Ontology

John

UpdatedOntology

Rocker

Entity 1

Entity 2

Is A

Machine Learning

Page 3: Research enabling other research  Infinite graph (UTD) is the prerequisite for EL++ (RPI, HP), Expanded Visualization (UCSB) and Topic Modeling (UC Irvine,

Entity Resolution Unique Approach – chaotic at all

points. Variable vocabulary and ontology.

Change in input ontology changes result.

Machine learning. Production quality only needing

packaging.

Page 4: Research enabling other research  Infinite graph (UTD) is the prerequisite for EL++ (RPI, HP), Expanded Visualization (UCSB) and Topic Modeling (UC Irvine,

Entity Resolution Unique Approach – chaotic at all

points. Variable vocabulary and ontology.

Change in input ontology changes result.

Machine learning. Production quality only needing

packaging.

Page 5: Research enabling other research  Infinite graph (UTD) is the prerequisite for EL++ (RPI, HP), Expanded Visualization (UCSB) and Topic Modeling (UC Irvine,

Infinite Graph Unique Approach – works at the

model level. Appears as if it is working in the jvm.

Leverages work from previous generations of technology.

Learned from others failures. Complete and in repository. Allows addressing of other

problems.

Page 6: Research enabling other research  Infinite graph (UTD) is the prerequisite for EL++ (RPI, HP), Expanded Visualization (UCSB) and Topic Modeling (UC Irvine,

Visualization No limits on nodes Natively visualizes RDF Scales in a browser No plugins Unmatched aestetics Specification compliant leveraging

google paradigm

Page 7: Research enabling other research  Infinite graph (UTD) is the prerequisite for EL++ (RPI, HP), Expanded Visualization (UCSB) and Topic Modeling (UC Irvine,

Ontology Homogenization World of many stores ontologies

and choices Distributed document retrieval Machine learning automation Partner with Raytheon Solution next year (design solved)

Page 8: Research enabling other research  Infinite graph (UTD) is the prerequisite for EL++ (RPI, HP), Expanded Visualization (UCSB) and Topic Modeling (UC Irvine,

Algorithms Design consistent Model to Model Variable vocabularies Self-addressed stamped envelope Complete Adding to code base without source

code (JEE deployer role)

Page 9: Research enabling other research  Infinite graph (UTD) is the prerequisite for EL++ (RPI, HP), Expanded Visualization (UCSB) and Topic Modeling (UC Irvine,

Thinking Outside the Box Entity Resolution (Ontology as Input,

Ontology updated through machine learning)

Infinite Graph (Graph Oriented Virtualization Algorithms)

EL++ (Polynomial Based Reasoning) Expanded Visualization (2D rendering,

virtualized memory) Topic Modeling (Chaotic Use of

Vocabularies)

Page 10: Research enabling other research  Infinite graph (UTD) is the prerequisite for EL++ (RPI, HP), Expanded Visualization (UCSB) and Topic Modeling (UC Irvine,

Recognition

Entity Resolution (McCallum) Infinite Graph (Khadilkar) EL++ (Seaborne, Zaki) Expanded Visualization (Hollerrer) Algorithms (Zaki, Smyth) Workflow (Day,Zysman) Ontology Homogenization (Partyka)