Atlas Ti

ATLAS.
ti
The Knowledge Workbench
Scientific Software Development - Copyright 2001 Thomas Muhr
This set of 21 PowerPoint transparencies contains information about

concepts and use of ATLAS.ti, Please read copyright note on
transparency no. 2.
Scientific Software Development -

Copyright 2001 Thomas Muhr
© Copyright Note
Scientific Software Development - Copyright 2001 Thomas Muhr
The PowerPoint transparencies included in this package may be

used to support your ATLAS.ti workshops, training sessions &
demonstrations.
You may alter the transparencies to fit your needs, but please do not
remove original copyright notes. If you have any transparencies
either self made or created via modification of the existing sheets we
will all be happy if you make these available for the public.
In no event may the transparencies included in this package be
commercially exploited (e.g., sold) either altered or unaltered without
prior written permission by the author, Thomas Muhr, Berlin.
Scientific Software Development -

Copyright 2001 Thomas Muhr
ATLAS.ti - The Knowledge Workbench
Basics: Advanced Topics:
 QDA & ATLAS.ti  Beyond Text: Working with
ATLAS.ti®
graphics, audio & video materials
 VISE: Visualization, Integration,  Structures: Weaving semantic
Serendipity and Exploration
networks
 Users: from Sigmund Freud to  Hypertext: What codes can’t do for
Sherlock Holmes
you
 The main concepts: of Hermeneutic  Retrieval: Using Boolean, Semantic
Units, Families and other species
and Proximity operators
 Strategies: Textual and Conceptual
Super Codes: Intensional codes or
© Scientific Software Development, Berlin, 2001

Scientific Software Development - Copyright 20
level
frozen hypotheses?
 The user interface: Keep focused on  Cooperation: Merging projects
the data
 Back to the future: The Paper &
 Interfaces: ASCII/ANSI, SPSS,
Pencil look & feel HTML, PROLOG, WMF, XML
 Basic Procedures: Coding,
 Miscellaneous: Data safety,
commenting, retrieving, printing, memo outsourcing, text
management, setup, capacities
01 Thomas Muhr
preparing,
4 Basic Principles: VISE
Visualization
ATLAS.ti®

 Use adequate tools for handling complexity and stay focused on the
data
 Integration
 Bundle all relevant data and interpretations into a unique project: the
“Hermeneutic Unit”
 Serendipity
 Make relevant discoveries without searching...
 Exploration
 Traverse the “interpretative threads” between data, codes, and
01 Thomas Muhr
memos
Areas of Application
Marketing Research
ATLAS.ti®
Literature Education
Medicine
Public Health
Social Sciences
& Humanities
Libraries & Archives

Applications
Theology
Astronomy
Art Planning Urban

Development
01 Thomas Muhr
Criminology
Textinterpretation as Text-to-Text
ATLAS.ti®
Compile the primary Result: another text,

Open up a “Context of Discovery” diagrams, a WWW-
documents: Texts, to explore the data and add structure
01 Thomas Muhr
Graphics, Audio, Video document ?

A HU’s Abstractional Layers
Hermeneutic Unit
ATLAS.ti®
Code family uses uses
Super Codes uses
Families
causes
Networks
isa causes
isa
Codes
indicated-by
indicated-by
indicated-by
Quotations supports
contained-in contained-in
01 Thomas Muhr
Primary
documents
01 Thomas Muhr
Graphical Primary Documents

contents
Graphical list of
with a mouseclick
for image sections
Display comments
ATLAS.ti®
Industry Standards supported
by ATLAS.ti 4.2
SGML
ASCII
ATLAS.ti®
XML 1.0
TIF, JPG, Kodak PCD, SUN Raster... Currently memos and codes
HTML Not supported

Standardization
WMF Exported
BMP ANSI Imported
PCD Im- & Export
RTF APN
Will be supported in 5.0
SPSS
01 Thomas Muhr
Presentation Representation
Inter-Application Data Exchange
Text can be dragged from
WinWord or any other text
ATLAS.ti®
processors (capable of OLE-
2 drag & drop) into ATLAS/ti.
Text import is also available
via Copy & Paste.
A mouse click displays the

new memos’ text.
Dropped into a Network View, a

01 Thomas Muhr
new memo is automatically

created from the text
HTML Code Generator
ATLAS.ti®
The conversion of Hermeneutic Units

01 Thomas Muhr
into HTML code enables new ways of

structured publishing. Research
teams can quickly exchange ideas
and complete projects world wide.
The HU Editor
- ATLAS.ti’s main work space
Main menu Main toolbar
ATLAS.ti®
Dropdown fields for
Primary Document Primary Docs,
area Quotations,
Codes and Memos
Margin area
Selected Quotation
Splitter bar
to resize panes
Context menu
Detached
code list
01 Thomas Muhr
01 Thomas Muhr
Network Editor
ATLAS.ti®
Hypertext - what codes cannot do
Code
CodeAA
While codes describe similarity of the
ATLAS.ti®
Q1
coded segments, it is hard to represent
relations (beside the equivalence
relation) between individual segments.
Only direct links (“hyper-links”) between
segments enable the representation of
such local knowledge.
contradicts If one would establish a link between the
codes in the example to emulate a hyper
link, we would have to assume that these

supports codes do not refer to any other
segments, but are used as labels for
Q2 individual segments: a clear “misuse” of
codes....
ATLAS/ti supports named links between
data segments.
01 Thomas Muhr
Code
CodeBB
Q3
The QueryTool
The QueryTool retrieves data segments by their attached codes using Boolean,
proximity and semantic operators. Queries are entered in RPN calculator style.
ATLAS.ti®
Stack manipulation
Clear stack
Swap the two
topmost elements
OR Push - duplicate
Boolean Families topmost element
XOR
operators AND Term stack Recalculate results
NOT Undo last operation
SUB Redo last undone
Semantic operation
operators UP
Feedback pane
SIB
WITHIN Codes Create Super Code

ENCLOSES
Change feedback
OVERLAPPED_BY
OVERLAPS
display mode
Proximity FOLLOWS
operators PRECEDES
COOCCUR Results Textbase selection
Follows/Precedes
01 Thomas Muhr
distance control
Retrieval Methods I - Boolean Retrieval
Boolean retrieval is purely set based. Elements are assumed to be independent.
No property of a retrieved segment other than being coded with codes A,B,..X
is taken into account.
ATLAS.ti®
Overselectivity: AND (A1, A2, ..., An) fails even with n-1 matching terms.
Underspecified: OR (A1, A2, ..., An) succeeds with everything from 1 to n
matching terms. A segment coded with only one code is treated equal to one
coded with all of them.
A or B not (A or B) Document universe: Q1,...,Q5

A xor B Query examples:
Q1 Q4 A -> {Q1, Q2, Q3}

B -> {Q3, Q4}
A Q3 B Q5
not A -> {Q4, Q5}
A or B -> {Q1, Q2, Q3, Q4}
Q2 A xor B -> {Q1, Q2, Q4}
not (A or B) -> {Q5}
A and not B -> {Q1, Q2}
A and not B A and B not A and B A and B -> {Q3}
01 Thomas Muhr
not A and B -> {Q4}

Retrieval Methods II - Proximity Retrieval
Proximity retrieval takes the spatial relations between the retrieved elements
into account. A segment can overlap, follow, enclose or simply cooccur with
another segment.
The semantics were adapted from Allen’s time logic calculus.
ATLAS.ti®
Primary document P1 In addition to the Boolean
conditions described above, the
A following proximity relations hold:
1
Q1
2
3 B overlaps A -> {Q3, Q4}
4 Q4 A overlapped by B -> {Q1, Q2}
5 C overlaps B -> {Q5}
A within C -> {Q2}

6
7 A overlaps C -> {Q3}
8 Q5 C follows A -> {Q5}
9 B overlaps C -> {Q3, Q4}
10 Q2 etc.
11 B Note, that proximity operators are
12
13 Q3 non-commutative:
01 Thomas Muhr
B op A is not the same as

14
C A op B
15
16 Operand input order is significant!
Retrieval Methods III - Semantic Retrieval
Semantic, or thesaurus-based retrieval takes transitive relations between the
terms (codes) into account. Its quality is dependent upon the quality of the
semantic network used.
ATLAS.ti®
Example queries using the semantic operator SUB While the extension of sub (Positive
on the terminology network below: Attitude) and or (Love, Kindness) is
sub (Positive Attitude) -> {Q1, Q2, Q3, Q4, Q5} identical for the example below
sub (Negative Attitude} -> {Q6, Q7, Q8} {Q1,..,Q5}, the intension is different.
sub (Attitude) -> {Q1,.., Q8} The former query will - unaltered! -
Q1 yield different results with another
subterm of Pos. Attitude. The latter
Attitude
Attitude query will not ecognize this new fact
isa isa
and has to be reformulated.
Positive
Positive sibling Negative
Negative
Attitude
Attitude Attitude
Attitude
isa isa isa isa
Love
Love Kindness
Kindness Hatred
Hatred Anger
Anger
indicated by Domain level
01 Thomas Muhr
Document level
Q1
Q1 Q3 Q4 Q6 Q7 Q8
Q2 Q3 Q5
Q2
QueryTool: Building Queries
Boolean, proximity and semantic operators are combined using the “click-
language” par excellence: the Reverse Polish Notation (RPN) by
ATLAS.ti®
Lukasiewicz1.
RPN is a parenthesis-free postfix language: operands first, then the operators.
The main ingredience of the RPN query processor is the Stack, a data
structure, that is very similar to a pile of plates: It can only be accessed from
the top: new plates are put on the pile, plates can only be removed from the
top. Old HP 29C RPN calculator
Example: “All quotations coded with ‘Positive Attitude’ and any

of its sub codes but not with ‘Kindness’”
in formal infix notation: SUB Pos. Attitude AND NOT Kindness Number of arguments
Step: 1 2 3 4 5
Enter: Pos. Att. SUB (1) Kindness NOT (1) AND (2)
Stack: Pos. Att. SUB(Pos.Att) Kindness NOT(Kindness) AND(NOT(Kindness), SUB(Pos.Att))

- - SUB(Pos.Att) SUB(Pos.Att) -
Result: {} {Q1,...,Q5} {Q3,Q4,Q5} {Q1,Q2,Q6,Q7,Q8} {Q1,Q2}

01 Thomas Muhr
Note, how every operator takes (“pops”) its appropriate number of arguments from the stack and “pushes” the
resulting term back on the stack. Every entry, operand or operator generates a result. No “syntactic sugar” is
needed as in “infix” notations (eg. parentheses).
1
Born 1878 in Lvov (now Ukraine), died 1956 in Dublin, Ireland.
Polish Minister of Education in 1919 and professor at Warsaw University from 1920 to 1939)
The QueryTool: Super Codes
A well constructed, non-trivial query is often the result of a considerable
amount of work and ways to make a query reusable are needed: Super Codes.
ATLAS.ti®
Super Codes are also an important tool for theory construction as they capture
hypotheses for repeated validation against the data.
Normal codes store direct quotation references, super codes store queries.
Although the visible “clicking behavior” of a super code resembles that of normal
codes, there is a considerable difference of “how” each generates its references:
Normal codes deliver their Super codes are “first class”

quotation references.
objects and can be used in

The result changes only by queries (and in other super
explicitely assigning new or codes).
removing existing references.
Super codes recalculate the

stored query “when-needed”
and deliver the result. When
Query X any of the conditions of the
query change, the super
01 Thomas Muhr
codes result list changes as

Unlike other approaches that store the well - without any changes to
“extension” (the result set) of a query, super the latter.
codes store the queries’ “intension”.
Team Work - Merging Projects I
Merging projects is mandatory for the support of teams
working on separate data and/or different code sets.
ATLAS.ti®
A number of stock merge strategies permits efficient
control over the resulting project. Strategies can be freely
adapted to fit specific needs.
Team A‘s
Team A combined project
All teams‘
combined project
Team B
01 Thomas Muhr
Team B‘s
combined project
Merging Projects II - Strategies
Merging proceeds as subsequent and repeated merging of partial projects into a target project.
A merge strategy controls the method of how the different object types (e.g. primary docs,
ATLAS.ti®
codes) from the source projects migrate into the target project.
Examples:
A Different data sets, same codes
This strategy supports an economic handling of large primary data in a top-down
approach.
B Same data, different codes
By applying this method, different aspects of a theory can be applied to the same data
sets.
Example (Pi ::= primary documents, Ci ::= codes):

HU1 {P1,..,Pn} {C1,..,Cm} source project
HU2 {P1,..,Pk} {C1,..,Cm} target project (before merge)
Target project after the merge:

Strategie A: HU {P1,..,Pn,Pn+1,..,Pn+k} {C1,..,Cm}
01 Thomas Muhr
Strategie B: HU {P1,..,Pn=k} {C1,..,Cm,Cm+1,..,Cm’}

What’s new in ATLAS.ti 4.2
ATLAS.ti®
 WYSIWYG - printouts of primary texts plus margin
 Media - fine-grained segmentation and coding of video and
audio files (incl. MP3!)
 Improved Margin Area
 Networks - vector export to drawing software, Word® etc.
 Wordcruncher - count word occurrences and calculate

type/token ratio.
 New reports
 Primary Doc Path Mapping Tool
 XML - memo and code import & export
01 Thomas Muhr

Atlas Ti

Загружено:

Сведения о документе

Исходное описание:

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Atlas Ti

Загружено:

Авторское право:

Доступные форматы

ATLAS.

This set of 21 PowerPoint transparencies contains information about

Scientific Software Development -

The PowerPoint transparencies included in this package may be

Scientific Software Development -

 QDA & ATLAS.ti  Beyond Text: Working with

Libraries & Archives

Art Planning Urban

Compile the primary Result: another text,

Graphics, Audio, Video document ?

Graphical Primary Documents

HTML Not supported

A mouse click displays the

new memos’ text.

Dropped into a Network View, a

new memo is automatically

The conversion of Hermeneutic Units

into HTML code enables new ways of

link, we would have to assume that these

WITHIN Codes Create Super Code

A or B not (A or B) Document universe: Q1,...,Q5

Q1 Q4 A -> {Q1, Q2, Q3}

not A and B -> {Q4}

A within C -> {Q2}

B op A is not the same as

Example: “All quotations coded with ‘Positive Attitude’ and any

Stack: Pos. Att. SUB(Pos.Att) Kindness NOT(Kindness) AND(NOT(Kindness), SUB(Pos.Att))

Result: {} {Q1,...,Q5} {Q3,Q4,Q5} {Q1,Q2,Q6,Q7,Q8} {Q1,Q2}

Normal codes deliver their Super codes are “first class”

objects and can be used in

Super codes recalculate the

codes result list changes as

Team A combined project

Example (Pi ::= primary documents, Ci ::= codes):

Target project after the merge:

Strategie B: HU {P1,..,Pn=k} {C1,..,Cm,Cm+1,..,Cm’}

 Wordcruncher - count word occurrences and calculate

Вам также может понравиться