Mining and visualizing robust maximal association rules on highly variable textual data in entrepreneurship

Frédéric Simard, J. St-Pierre, Ismaïl Biskri
{"title":"Mining and visualizing robust maximal association rules on highly variable textual data in entrepreneurship","authors":"Frédéric Simard, J. St-Pierre, Ismaïl Biskri","doi":"10.1145/3012071.3012097","DOIUrl":null,"url":null,"abstract":"Searching for reliable information in textual data with highly heterogeneous vocabulary yields major difficulties. The task at hand was to study an amalgam of transcripts of think-aloud experiments conducted with entrepreneurs with different backgrounds. The many different backgrounds of the entrepreneurs are translated into the high variability of the vocabulary found in the transcripts. In an effort to reduce this variability while using the method for investigating textual databases in the form of association rules presented by Agrawal et al. [1], is exposed a novel approach based on the use of synonyms to standardize the data prior to applying association rules. Moreover, as association rules retrieval techniques produce large datasets and because those statistical objects express relationships between items, a method to analyze those discovered associations in the form of a network is further presented. This enables the use of Graph Theory/Network Science, two mature related fields whose methods can lead to interesting and nontrivial discoveries.","PeriodicalId":294250,"journal":{"name":"Proceedings of the 8th International Conference on Management of Digital EcoSystems","volume":"127 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 8th International Conference on Management of Digital EcoSystems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3012071.3012097","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Searching for reliable information in textual data with highly heterogeneous vocabulary yields major difficulties. The task at hand was to study an amalgam of transcripts of think-aloud experiments conducted with entrepreneurs with different backgrounds. The many different backgrounds of the entrepreneurs are translated into the high variability of the vocabulary found in the transcripts. In an effort to reduce this variability while using the method for investigating textual databases in the form of association rules presented by Agrawal et al. [1], is exposed a novel approach based on the use of synonyms to standardize the data prior to applying association rules. Moreover, as association rules retrieval techniques produce large datasets and because those statistical objects express relationships between items, a method to analyze those discovered associations in the form of a network is further presented. This enables the use of Graph Theory/Network Science, two mature related fields whose methods can lead to interesting and nontrivial discoveries.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
创业中高度可变文本数据的鲁棒最大关联规则挖掘与可视化
在具有高度异构词汇表的文本数据中搜索可靠信息产生了很大的困难。手头的任务是研究由不同背景的企业家进行的有声思考实验的综合记录。企业家的许多不同背景被翻译成文本中发现的词汇的高度可变性。在使用Agrawal等人[1]提出的以关联规则形式调查文本数据库的方法时,为了减少这种可变性,提出了一种基于使用同义词在应用关联规则之前对数据进行标准化的新方法。此外,由于关联规则检索技术产生大型数据集,并且由于这些统计对象表示项目之间的关系,因此进一步提出了一种以网络形式分析这些发现的关联的方法。这使得图论/网络科学这两个成熟的相关领域的使用成为可能,它们的方法可以导致有趣和不平凡的发现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Integration of brainstorming platform in a system of information systems A robust associative watermarking technique based on frequent pattern mining and texture analysis A semantic-web-technology-based framework for supporting knowledge-driven digital forensics Meaning-based content word alignment heuristic Formal proof of security algorithms based on reachability reduction
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1