检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:甘鑫 罗慧 戴灵慧 王华 GAN Xin;LUO Hui;DAI Linghui;WANG Hua(College of Furniture and Industrial Design,Nanjing Forestry University,Nanjing 210037,China)
机构地区:[1]南京林业大学家具与工业设计学院,南京210037
出 处:《家具》2024年第6期42-46,128,共6页Furniture
基 金:教育部产学合作协同育人项目(202101148004);江苏省高校哲学社会科学研究项目(2022SJYB0153)。
摘 要:电商平台的用户评价包含了用户对于产品的态度与关注点,为探究从中获取用户需求及关注度的可行性,使用Python网络爬虫从国内某电商平台爬取了学习台灯类产品的6348条评价数据,借助开源自然语言处理工具HANLP对数据进行分词、词性标注、关键词提取、词频分析、词云生成,提取出用户对于产品光学参数、交互方式、结构、产品外形等类别的需求点和关注度,并最终完成需求转化。结果表明:该方法应用于具有一定用户评价数据量的产品调研时,能显著加快需求分析速度;而对于数据量不足的产品,使用该方法会有一定的误差。This study investigates the feasibility of extracting user demands and levels of concern from user evaluation on e-commerce platforms,which reflect users'attitudes and priorities towards products.A total of 6,348 user reviews for study desk lamps were collected from a prominent domestic e-commerce platform using a Python web crawler.The collected data were then processed using the open-source natural language processing(NLP)tool HANLP,including segmenta-tion,part-of-speech tagging,keyword extraction,word frequency analysis,and word cloud generation.By analyzing the data,user demands and levels of concern were identified in categories such as optical parameters,interaction methods,structure,and product appearance.These insights were further utilized to transform the identified demands into actionable outcomes.The results indicate that this method significantly accelerates the speed of demand analysis when applied to product research with a substantial amount of user review data.The extracted keywords provide valuable information on user preferences and priorities,enabling product improvement and design optimization.However,for products with limited rview data,the use of this method may be associated with a certain degree of error.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.248