Kiewiet, D.J.

English

Nowadays many of organizations pay attenlion to Infomation Planning. Several definitions exíst of Information Planning but one common aspect in all these definitions is the attenlion for the future information systems support of an organization. So, Information Planíing leads to the definition of an information systems plan for the organizalion. The specification of all the information systems together in such an Information Plan is the infomation system architecture of the organization. ... Zie: Summar

ARTS repository - University of Groningen

   University of GroningenFormalisatie van informatieplanningKiewiet, D.J.IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite fromit. Please check the document version below.Document VersionPublisher's PDF, also known as Version of recordPublication date:1996Link to publication in University of Groningen/UMCG research databaseCitation for published version (APA):Kiewiet, D. J. (1996). Formalisatie van informatieplanning: over de toepasbaarheid vanclassificatietechnieken op informatiearchitectuur-specificatie. Labyrint Publication.CopyrightOther than for strictly personal use, it is not permitted to download or to forward/distribute the text or part of it without the consent of theauthor(s) and/or copyright holder(s), unless the work is under an open content license (like Creative Commons).The publication may also be distributed here under the terms of Article 25fa of the Dutch Copyright Act, indicated by the “Taverne” license.More information can be found on the University of Groningen website: https://www.rug.nl/library/open-access/self-archiving-pure/taverne-amendment.Take-down policyIf you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediatelyand investigate your claim.Downloaded from the University of Groningen/UMCG research database (Pure): http://www.rug.nl/research/portal. For technical reasons thenumber of authors shown on this cover page is limited to 10 maximum.Download date: 06-06-2022SultÍlrÍARY.Itrformntion !rchitecturê !p€cifi catiotr.Nowadays many oÍgadzations pay atlenlion Io Infomation Planning Several definhions eístoflntoÍmarion Planning, bur one common aspêcr in all thes€ definilions is rhe aftenlion for rhefurur€ ;nlomation systems uppon ofan orSanization. So, InfoÍmarion Planíing leads ro thed€finilion of an infoÍmation lystems plan for the orSanizalion. The specificaiio. of all theinformÀtion systems togelher ir such an I.fornration Plàn is th€ infomation sysrem architec-ture ofthê orgadzationThe slaning point fo. lhe specification of such an information architecture is formed by theinfoínation processing activities in dre orsanization, the so-called business process€s Thesebusiness processes opeíate on enlity types: aggrcgates of data in lhe organization. Usually,ther€ aíe three possibilities for business proc€sses ro opeÍare on enrily rypes: l) a businessprocess only uses dala ofa ceíain type, 2) a business pÍocess creares or changes dala ofaceíain €ntity typ€, and 3) a busines process does nolhing with the dara of a ce.rain entilytype. BLrsincls pÍocesses, entily rypes and operations are rep.esented in an ;nformarion matÍix,!v;th lhc rows repíeserting the business proccsscs, the columns íepÍ€senling the entity types,and the cclh representing the rypes ofoperation (a "U" in a cell denoles poss;biliry l: use, a"C" dcnoles possibilily 2 crcatc, and a "0' denotes possibility l: norhlng)For getling a.;nformatior aÍchitecture, business proceses and entiry lypes in an inlormarionmalrix a.c grouped in seveÍal informalion arcas, *.hich are the bases for info.mation lysremsThis gÍoupins pÍocess is not trivial resea.ch has sholvn rhar expcricnccd infoÍmarion plannerswere nol ablc tojudge infoírration system architcctures in a consist€nt and consequent manner.ln oÍdeÍ to make it po$ible that info.mation plannêrs hale conrpureÍ-suppofi foÍ rhe specifica-iion ofar infoÍmalion archilecture, a formalizarion of;nfoÍ.alion aÍchilectu.e speciíjcation isnecessary. HoweveÍ, such a formalization does not exisr yet At rhe end ofchapre. l, rhk leadsto lhc following research-objecrive and questions2 i 5o objeclivclo t"1 d I i : i " g i | íorn,a I nu a rch i t e c | | rè sp c fi ca I nn :o questrons:I to n hat extenÍ is it possiblc to /o nlize íhe dpprcciatiol of an Dtomationd|chll!cul|e:2 to rhat cxte t is h! co sidemtiol of i\.lonntio architectwe specífcatiotlasacldsst catiok t1toble"1hcl tl ,1 gettcmtitlg DtÍonlatiai .vchitectwes.In Chapter 2 traditional methods ofinformation ArchitectuÍe speciflcation are descdbed andcriticired One conrmonly used fanrily of methods for inforrnation architecture specificationtransfoÍms lhe informarion mal.ix so lhat lhe columns oflhe informatioó matÍix are traÍsposedso rhat  rhe C-cel ls 'o f rhc rnarr ix  are on the topleÍ i -bot tomÍ ighr  d iagonal  of the mat ix  Aroundthis di.gonal rectanglcs are disringuished, $,heÍe ench Íecrangle idcnrifies an information aÍ€àIn rlese pÍocesses oftÍansfi)Íming and distinsuishing. lhrcc objectives are consideÍed:o Iocal izat ionofdata-cÍeat ion,o n in inr iz . r ionofdata-cxc l )nnge,o mdr im, /d l ,on ofcoherencc È,rh,n in fohrdr ion \ystcm' .One nlajor cÍiticism of these ;nlornlalion architcctuÍe spcciÍlcation medrods is that lhescobjccrives a.e ,o/ opefntionalized. accause oflhis, infonnltion arc|ilectufe spcciÍlcalion has asubsranrilc subjecrivc onrponent One ofthe conclusions at lhe end ofChapler 2 is, that Ínoíeobjective dcscr;prions lor information architectuíe specificalion halc ro be looked foÍ1 h€ Gcncnl ized Cl : tss i f i  càt ior  ̂ Íodr l .In Chaprer 3, ope.arionalization ofthc objectivcs nrenlioncd bclore was pcrlo ed by makinga rnrrheni i t ica l  model  o l in formal ion aÍchi tcctuÍe spcci f icat ion:  the Gene'a l ized Classi f icat ionNlodcl '1\vo sers Àre tl)e bascs for the Írodel, onc ser (B) rcprcscntins the business p.ocesscsin lhe ofganizario. for \vhich lhc inlonnation architcct!re hàs lo bc specified, lhe orher sel (D)Ícprcscnt lns th.  ent i r j  lypes On lhc ( lanesian f Íoducl  oÍ  lh€se Nvo sels  a nrapping u hdefi.ed, rcprese.ri|g the possiblc oferatlons berwcei busincss processes and enlity types.S u b s e t s o f B x D Í e p rture, lhe nol ion ofa bkln the ceneralized Clab€€n done by looking lmatrix in which a "C"lakes in  àccounl ,  for  ethat paÍ How large. Iever, the value on MEvalue on ME, ie  morlooked at. TheÍefoÍe, llofD have to been lookiIn order  to ope6l ionaldefined by intíoducingrelation Jl" is used toused ro speciry lhe relaQuant;fication of dala-funct ion S,  ca l l€d paj rquantifies lhc pÍcsencecouples of  pai rs ,  one fexchange for a blockJcoulles of diflcrcnt blo(Coherence within an ;cnangc betlleen two pànd an entrty lype Warchilectue spcciílcatic2 1 6tio" of an i)foÍmatiarhi I ec ttlre spec if ca I i on:ion are described ÀndhhectuÍe specificarionL malnx are rransposedofthe maÍix Aroundrs an inlormation aíeaSubsers ofB ' D .epresent info.mation areas, and in orde. to define an inloÍmation architec,lure, the notion ofa block-panition is inrÍoduccd (íoralion: P(B : D))ln the Generalized Classification IvÍodel, operationalization oflocalization ofdala-crearion hasbeen done by looking in thc inlormation matrix 1{] the neighbours of a cell in tlre nrformationmatÍix in which a 'C' is placed Quanlification was realized by using the fundion NÍE whichtakes in accounr, foÍ each paiÍ fÍom B t D, rhe vaTucs on lhe mapping u for the neighbours ofthat pa; How laÍgeÍ thc vslue on iUE, how mo.e localizalion ofdara c..arion lheÍe is How,ever, the valuc on l\'ÍE is dependcnr on a ccnain ordeing oflhe elenrenls ofU and D A largervalue on l t ÍE,  ie  moíê local izar ion,  is  pcrhaps possib le i fanotheÍ  oÍdc. ins of lhc c lcmcnrs islooked at TheÍefore, rhosc ordcrings (or permutations) ofrhe ele enrs of B and rhe elemcntsolD have lo bccn looked foÍ, that maximizcs lhe function N{E.ln order to ope.ationalize the oblective of nrinimization ofdata e\ch.nge, data-e\change wasdefined by inrroduciig xvo rclalions tl" and $p ií lhe Ge.era!izcd Classification Modcl ïherelation ,1" is Lrsed to dcfinc data-cÍchange between lwo pain of B ! D, and lhis rclation isused to speci ry  the Íe lat ion l l r  which def i res data exchanse betqeen vo b locks ofP(B x D)Quant i f icat ior  of  data-exchange is  i ' r  the model  acf i ieved t ry  in l rodlc i rg l$o l i r rc t ioDs:  thefunct ion S,  ca l led paiFcohc\ ion,  a id t Ic  fu icr io i  S,  ca l led b loc l -co l ies ion '11r .  l i rnct ion SLquant i f ics thc prcseice ofan ,1,  rc l r t ion ] -he funcl ion S,  denorcs foÍ  t$o i , locks thc nunrbcr  ofcouples of  pai .s ,  onepair in  each b lock,  fo f  $hich lhere ex isrs !  J l .  rehl ron The tot r l  data-c\chaige foí a block'prnilion can no$ bc defiied as the slid of S,^rl!cs foÍ all possiblecouples ofd i Í le Ícnt  b locks in  the b lock pani t ionCoherence lvithin an inftnnration syíenr can be operaiionalized as rhe a' ounr of dara-es-changc between two f i Ís  bc longing to or ie  b locL,  each ta i r  rep,escor l rs  ^  bLrs i icss píocessand an ent i ty  typc Whcn !s l rg th is  oterat ional izr t ion,  the th i Íd  objec l ive Í i r  in lbnnal ionaíchi tectu ie speci fca l io i  c0f  bc!uar( i l led in  the Dodelby!s inglhe l idc l iors S,  ind S,nelhods is lhat lhescuÍe specification h.5 alhapler 2 ;s, rhat moÍepeírormed by nrakingLeÍalized Classi6cationlhe bLrsiness processesified, rhe orlrer set (D)s e r s a r n a p p r n g u r siscs and cntLty rypcs211tion aÍan iuhrnatíanh i te chÍe spe c i.licar i onion are descr;bed andhitecture specifi cationnatax aíe ríansposedofthe matrix. AÍounds an information area.Subsets ofB ' D repÍesent information a.eas, and in order to define an informatio. archtec-luÍe. the notion ola block panition is intÍoduced (notation P(B r D))In the Generalized Classificalion Model, operationalizalion orlocalization ofdata-creation hasbeen done by looking in the;nfoÍmation maÍix to the neighbou6 of a cell;í the info.matio.matrix in which a "C" is placed. Quantification was reallzed by usins rhe tunction ME whichtakes in account, for each pair f.om B x D, the values on lhe napping u fo. rhe neishbours ofthat pair. How laÍger the value on NÍE, holv more localizalioi ofdata-cÍeation the.e is How-eveÍ, the value o. ME is dependent on a ceÍain ordering ofthe elemeirs ofB and D A la.ge.value on ME, i.e. more localization, is peÍhaps possible ifanolher ordeÍing ofthe elements isiooked at Therefore, rhose orderings (or permutations) ofthe elenre.ts ofB and the elementsofD have to bee. looked for, that maximizes the irnclion MEln order to opeÍationalize the objective ofminirii?ation ofdata-cxchange, data-exchange wasdefined by inÍoducins rwo relalions Ji. and 0l! in the Gene'alized Classification Model The.elatio. ti. is used to define data-exchange between t\vo pai6 ofB x D, and this relation isused lo speciry the relation lte which defi.es data-erchange bet*een two blocks ofP(B r D)Quantification of data-exchange is in the model achie!ed by iftroducing two funcrionsr thefunclion S, called paif cohesion, and the tunction Sr called block-cohesion Thetunction Slquantifies the presence ofan 01. Íelation The function S) denotes for two blocks the nunrber ofcouples of paiÍs, onc pair in each block, foÍ which therc cxisrs a Jl. Íelation. The total daiaexchanae for a block paíition can now be deflned .s rhe sun of S,-valucs for all possiblecouples ofdifI€rent blocks in the block-parlilionCoheÍcncc within an informalion systcm can be operationalized as the arnount of dara ex-chenge benleen xro paiÍs bclongins to one block, each paiÍ Íef'es€iting a busjness proces!and an cntity type \Vhe. using this opeÍatlorallzation, lhe third objecrive Íbr inlormalionarchilcctu.e spccification can be quantified in the model by using the furctions S, and S,.lerhods is that theseufe specificÀlion has alhapter 2 is, that mo.epeÍformed by making€ralized Classifi cationhe business p.ocessesfied, the orheÍ sct (D)s e l s a m a p p ' n a u ' s6es ano enrry Íypes.2 1 7i!,Íi.imization ofdarà'excharse bctwcen blocks and maxinizalion ofcoherence are combinedinto one objective tunction F.At rhe end ofChapteí 3 it is aÍgued that the problem offinding those pennutations ofB and Dwhich yield an optimal value for ME (a subpÍobl€m ofthe maximizaron ofF), is NP-haÍd. So,io '  obr l ,n inS a solu l ion.  one hd.  ro re l )  on her  d(r ics.Cêll mrnuf,rcluring forlt.tion.In Chatrer 4 another interp.etarion of the Gene'alized Classification Model is given Thisinterpretalior is the problem ofcell nranutoctuing foÍnrarion ln this pÍoblenr, Ínachines andparrs (both n€cded foÍ pÍoducing a ceíain produc0 are aíansed nÍo cells, makiíg use ofrouring inlormation This Íouring information describcs which pa.rs are pÍoccssed on whichnacfinlcs The cells are so consrrucled thar machines thar proc€ss the sam€ pans, and paísthal are processed by the same nrachires, are grouped ;nlo ooe machine-pan woÍkcell So.;nfo.mation architecture specification and cell manufactuÍing fo.nratioí .esemble each otherthey are interprelalions of rhe same GeneÍalizcd Classificalion Model. The benefit of thissimilarity is lhal seleral heuíistics, used oneí in lhc a.ea ofcell Ínanufacruring formation, canbe appli€d in rhe a.ea ofinfoímÀtion architectufe spccificationCl : iss i f i  cn l ior  tcch ' r iqr 'cs ard iDfornrr l ior  nÍchi lec lnrê spcci f i  cxt ion.Th.ee hcurist;cs arc chosen 10 e\ploit lhe sinrilaÍitics behveen infoÍnation a.chilcctuÍe spêcifi-cat ion and cel l  l ranuiac luÍ ing fo nr l ion Thcsc lhree he! . isr ics àre c luíef  ani l ls is ,  mixedirlegcÍ p.ogÍarnnring. ard ncural net\voÍks In Chal)ter 5 thcsc hcuÍistics arc dcscdbed, and itis sho$n fornrally rhat llese heurisrics can be applicd foÍ solvins rlc ceneÍalizcd ClassificárionModcl, and rhcÍeby information architccture speciÍlcatio.In Chat tcr  6 l lese rhrcc heu. isr ics are conpaícd to each o lhcr  on lhe peÍ foÍmance of theobjcct i le  funcr ion F of the GcneÍa l ized Classi Í lcat ion NÍodel  This conrpaÍ ison isdonebyusingihc rhrce heudsr ics for  spec;ry ; rg in formal ion archl rcctures for a rcal is t ic  ase This case is  theCBR (Ce.t.al Ilureiu for cenilicales of driurg proficiency), rhc natioral ioíitution in 'Ihc2 1 8Nelherlands Íesponsibwith respect o drivingDue to the size oftheto speciry an informatiOn the other hand, thetuÍes. The besl informacation Model is lhe on€ln Chapte. T it ;s coíclrure specificarion) ;s alofcomputeÍ $rpporl fotion plaíning process)herence are combinedrnutations ofB and D,ofF), È NP-haÍd So,Nelheílands responsible for adnrinisteÍing €xams and for providing rnedical slatenents, bothwith Íespect lo dÍiving proÍlciencyDue to rhe size ofthe píoblem (51 busin€ss proc€sses and l0 entily rypet, it was nol possibleto sp€cify an informarion aÍchitectuÍe wilh help oírhe heurislic Mixed Integer ProgÍanningOn the other hand, the use of€lusteÍ analysis and neural net Save seven infomarion architec-rures. The beí informarion aíchitecrure with respect o the F-value ofthe GeneÍalized Class;fi-carion Model is lhe one obtained by usinS the neural netIn ChapreÍ 7 ;r is concluded rhar the Íesearch'object;v€ (fo.malizal;on ofinformarion architec-lure specificarion) is allaincd In lhc future, lhis formaliznlion can be used in the developmentofcompureÈsuppon foÍ infoÍmation planne.s, and *irh .hal for the mo.iroÍing ofthe info.ma-rion planning processI,lodel is given This)roblem, machines and) cêlls, making use of" Processed on whichsame pans, and partsine'pan woÍkcell So,I resemble ach other:,1. The benefit of thiscluÍing foÍnation, can)n architecture specifi -luíeÍ analysis, mixeds aÍ€ dcscribed, and itrcÍalized Classificalioíe pedormance of theLrhon is done by using, case. This case is the'nal iníitution in The2t9

Formalisatie van informatieplanning:over de toepasbaarheid van classificatietechnieken op informatiearchitectuur-specificatie

https://pure.rug.nl/ws/files/13152041/kieviet.pdf

Formalisatie van informatieplanning:over de toepasbaarheid van classificatietechnieken op informatiearchitectuur-specificatie

Abstract

Similar works

Full text

Available Versions

ARTS repository - University of Groningen