{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:26:13Z","timestamp":1743056773860,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030617042"},{"type":"electronic","value":"9783030617059"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-61705-9_6","type":"book-chapter","created":{"date-parts":[[2020,11,4]],"date-time":"2020-11-04T16:03:54Z","timestamp":1604505834000},"page":"61-72","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Visual Analytics for Production Line Failure Detection"],"prefix":"10.1007","author":[{"given":"Unai","family":"Arrieta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ander","family":"Garc\u00eda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikel","family":"Lorente","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c1ngel","family":"Maleta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,4]]},"reference":[{"key":"6_CR1","unstructured":"ACE: a fast multiscale eigenvectors computation for drawing huge graphs. In: Proceedings of the IEEE Symposium on Information Visualization, INFO VIS 2002, January 2002, pp. 137\u2013144. InfoVis (2002)"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-319-64471-4_31","volume-title":"Database and Expert Systems Applications","author":"NA Arafat","year":"2017","unstructured":"Arafat, N.A., Bressan, S.: Hypergraph drawing by force-directed placement. In: Benslimane, D., Damiani, E., Grosky, W.I., Hameurlain, A., Sheth, A., Wagner, R.R. (eds.) DEXA 2017. LNCS, vol. 10439, pp. 387\u2013394. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-64471-4_31"},{"issue":"3","key":"6_CR3","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J D\u00edaz","year":"2002","unstructured":"D\u00edaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Comput. Surv. 34(3), 313\u2013356 (2002)","journal-title":"ACM Comput. Surv."},{"key":"6_CR4","unstructured":"Dwyer, T., Koren, Y.: Dig-CoLa: directed graph layout through constrained energy minimization. In: 2005 IEEE Symposium on Information Visualization, INFOVIS 2005, pp. 65\u201372. IEEE (2005)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Elmqvis, N., et al.: ZAME: interactive large-scale graph visualization. In: IEEE Pacific Visualization Symposium 2008, PacicVis - Proceeding, pp. 215\u2013222 (2008)","DOI":"10.1109\/PACIFICVIS.2008.4475479"},{"issue":"5","key":"6_CR6","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1109\/TVCG.2006.120","volume":"12","author":"F van Ham","year":"2006","unstructured":"van Ham, F., Krishnan, N., et al.: ASK-GraphView: a large scale graph visualization system. IEEE Trans. Vis. Comput. Graph. 12(5), 669\u2013676 (2006)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"6_CR7","unstructured":"Heer, J., Boyd, D.: Vizster: visualizing online social networks. In: Proceedings of the IEEE Symposium on Information Visualization, INFO VIS, pp. 33\u201340 (2005)"},{"issue":"5","key":"6_CR8","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TVCG.2006.160","volume":"12","author":"N Henry","year":"2006","unstructured":"Henry, N., Fekete, J.D.: MatrixExplorer: a dual-representation system to explore social networks. IEEE Trans. Vis. Comput. Graph. 12(5), 677\u2013684 (2006)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"6","key":"6_CR9","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1109\/TVCG.2007.70582","volume":"13","author":"N Henry","year":"2007","unstructured":"Henry, N., et al.: NodeTrix : a Hybrid visualization of social networks. IEEE Trans. Vis. Comput. Graph. 13(6), 1302\u20131309 (2007)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Von Landesberger, T., et al.: Visual analysis of large graphs: state-of-the-art and future research challenges. In: Computer Graphics Forum, pp. 1719\u20131749 (2011)","DOI":"10.1111\/j.1467-8659.2011.01898.x"},{"issue":"6","key":"6_CR11","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1109\/TVCG.2009.151","volume":"15","author":"MJ McGuffin","year":"2009","unstructured":"McGuffin, M.J., Jurisica, I.: Interaction techniques for selecting and manipulating subgraphs in network visualizations. IEEE Trans. Vis. Comput. Graph. 15(6), 937\u2013944 (2009)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Schulz, H.J., Hadlak, S., Schumann, H.: Point-based tree representation: a new approach for large hierarchies. In: IEEE Pacific Visualization Symposium, pp. 81\u201388 (2009)","DOI":"10.1109\/PACIFICVIS.2009.4906841"},{"issue":"1","key":"6_CR13","first-page":"579","volume":"26","author":"D Sun","year":"2020","unstructured":"Sun, D., et al.: PlanningVis: a visual analytics approach to production planning in smart factories. IEEE Trans. Vis. Comput. Graph. 26(1), 579\u2013589 (2020)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"6","key":"6_CR14","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1109\/TVCG.2009.108","volume":"15","author":"F Van Ham","year":"2009","unstructured":"Van Ham, F., Perer, A.: Search, show context, expand on demand: supporting large graph exploration with degree-of-interest. IEEE Trans. Vis. Comput. Graph. 15(6), 953\u2013960 (2009)","journal-title":"IEEE Trans. Vis. Comput. Graph."}],"container-title":["Lecture Notes in Computer Science","Hybrid Artificial Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61705-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,4]],"date-time":"2020-11-04T16:08:26Z","timestamp":1604506106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-61705-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030617042","9783030617059"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61705-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HAIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Hybrid Artificial Intelligence Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gij\u00f3n","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"hais2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2020.haisconference.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"106","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"65","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}