Fill and Sign the Companions and Homemakers Timesheet Form

Developing a Formal Model for Mind Map Representation Vasilis Siochos, Christos Papatheodorou Database & Information System Group Laboratory of Digital Libraries and Electronic Publications Department of Archive and Library Sciences Ionian University, Corfu, Greece {vsiochos, papatheodor}@ionio.gr Contents ƒ Mind Maps ƒ Semantics ƒ Essential Characteristics ƒ Social Connection – ƒ Related Work ƒ Structure Web 2.0 ƒ Mind Map Model ƒ Content 2 Mind Maps ƒ “The mind map is an expression of radiant thinking and is therefore a natural function of the human mind. It is a powerful graphic technique which provides a universal key to unlocking the potential of the brain. The Mind map can be applied to every aspect of life where improved leaning and clearer thinking will enhance human performance” (Buzan, 1996). 3 Essential Characteristics ƒ the Mind Map has four characteristics (Buzan, 1993): ƒ The subject of attention is crystallized in a central image. ƒ The main themes of the subject radiate from the central image as branches. ƒ Branches comprise a key image or key word printed on an associated line. Topics of lesser importance are also represented as branches attached to higher level branches. ƒ The branches form a connected nodal structure. 4 Related Work ƒ “…similar to analyzing emails or other documents authored by a user, each node in a mind map may be taken as a description of the user’s skills or interests…” (Beel, 2010). ƒ “…How can data retrieved from mind maps be used to enhance search applications?” (Beel, 2010). ƒ “Two documents are related if they are both linked by a mind map” (Beel & Gipp, 2010). 5 Related Work ƒ “Μind maps could be used to enhance expert search, document summarization, keyword based search engines, document recommender systems and determining word relatedness” (Beel, Gipp & Stiller, 2009). ƒ “Use mindmaps to succesfully model, design, modify, import and export XML DTDs, XML schemas and XML dooc, getting very manageable, easily comprehensible, folding diagrams “(Dalamagas, Farmakakis, Maragkakis & Hatzigeorgiou, 2010). 6 Mind Map Model A 4‐tuple MM = < S, C, SC, SM > where: ƒ ƒ ƒ ƒ S: structure C: content SC: social connections SM: semantics 7 Structure A 4‐tuple S = where: ƒ ƒ ƒ ƒ N: nodes (set of Ni) E: edges (set of Ei) C: clouds (set of Ci) GC: graphical connector (set of GCi) 8 Node A 5‐tuple N = , where: ƒ T: node text ƒ nID: node ID (e.g. ID_1986153009) ƒ Nt: text content of the node (text or LaTeX) ƒ A: attributes, where ƒ A = (aj,bj), where aj, bj user defined content ƒ Frm: 7‐tuple of numbers (denote formatting values), where: ƒ Frm = 9 Edges ƒ The edges of the mind map are a set m edges which connect the nodes, E = {Ei}, i=1,2,…,m, where: ƒ edge Ei = where: ƒ nodeIDi, nodeIDj: the connected node ID’s ƒ FrmCd: the edge format code ƒ hid: boolean parameter of hidden ƒ EL: relational operator value "is a" or "" 10 Clouds ƒ The clouds of the mind map are a graphical way to group m nodes and n edges of a subgraph, Cl = {N1,N2,…,Nm,E1,E2,…,En}, where: ƒ N1,N2,…,Nm : the m nodes ƒ E1,E2,…,En : the n edges 11 Graphical Connectors ƒ The Graphical Connectors is a set of graphical connectors, GC = {GCi} ƒ A graphical connector GCi is a graphical connection between two nodes, beyond the basic mind map structure, GCi = , where: ƒ nodeIDi, nodeIDj : the connected tag ID’s ƒ T: a set of tags T = {tagi} tagging a connector 12 Content ƒ The content C of the mind map MM is a set of resources Ri, C = {Ri}. ƒ A resource Ri is a 4‐tuple, Ri = , where ƒ nodeID: the node ID ƒ label: the resource filename or the resource the same is the node text ƒ URI: Uniform resource identifier ƒ type: the type of the resource (text, photo, URL) 13 Content ƒ Node Tag Cloud NTCi={tag1,tag2,…tagn} for node i, where tagi=bj if aj=tag, (aj,bi) ∈ A. ƒ Neighbor Nodes is a set NBi={nodeID1, nodeID2,…,nodeIDn}, where nodeIDi are all the nodes connected through an edge. ƒ Format Classes is a set of nodes FCNi={nodeID1,nodeID=,… ,nodeIDn}, where each nodei has the same format. ƒ Icon Class is a set ICi={nodeID1,nodeID2,…,nodeIDn}, where each node has the same icon. 14 Semantics ƒ Semantics on a mind map is a function f: K → c, where ƒ K is the powerset P(NTC∩GCTC∩Flk∩T) ƒ c is a concept 15 Social Connections – Web 2.0 (1/3) Mind maps connections in a social network: ƒUser mind maps MMu is the set of the user mind maps MMu = {MMi}. ƒUser folksonomy Flk is the set of the user’s mind map tags, Flku = {tag1,tag2,…,tagn}, where tagi∈A for i = 1,2,…,n. ƒMind map tags MMtags is the set of user tags on a mind map, MMtags = {tag1,tag2,…,tagn}, where tagi∈A for i = 1,2,…,n. 16 Social Connections – Web 2.0 (2/3) ƒ User’s friends mind maps is the set MMUF = {MM1,MM2,…,MMn} where MMi , i=1,2,…,n, are the user’s friend’s mind maps. ƒ User’s F1 folksonomy expansion F1e through the folksonomy of user F2 is the set F2‐(F1∩F2). 17 Social Connections – Web 2.0 (3/3) ƒ User’s recommended friends is the set RU = {U1,U2,…,Un}, where Ui, i=1,2,…,n, are the users with at least one similar mind map with the user. ƒ User U1, with folksonomy F1, is a common friend to user U2 ,with folksonomy F2, if there exists a user U, with folksonomy Fu, if (F1‐(F1∩FU)) ∩(F2‐(F2∩FU))≠∅ 18 Mind Map Model 19