Eros1on的博客

目录数据清洗Apriori结果数据清洗挑选5000多条美国专利数据进行关联分析，首先设置支持度为0.01，找寻5000多条数据中被引用次数在50条以上的专利，认为其为核心专利技术首先用excel对参考专利数据进行简单的数据清洗，并使用nltk库进行分词import pandas as pdfrom nltk import word_tokenizedata=pd.read_csv("Desktop\\python_work\\435_2.csv")txt=data['UREF:PNO']#工作

目录分词Apriori结果分词应用python中nltk包分词首先在找到国际G（物理领域）的所有专利，最终得到6000多条专利数据。接下来应用python中nltk包对专利发明人进行分词import pandas as pdfrom nltk import word_tokenize#将编码utf-8改成gbkdata=pd.read_csv("Desktop\\python_work\\diming_data.csv",encoding='gbk')txt=data['INVT']#工作簿

目录综述1.数据来源与指标选取1.1数据来源1.2指标选取2.数据清洗与转换2.1数据清洗2.2数据转换3.决策树模型构建及准确性评估与优化3.1模型构建准确性评估与优化4.分析结果综述本次研究基于决策树方法对可能影响专利被引的6个影响因素（专利申请年、专利公开年、发明人数量、专利权人数量、发明人国家、专利权人国家）与专利是否被引的潜在关系进行分析。研究发现，专利申请年是其中影响最为显著的因素，而后依次是发明人数量、专利公开年数量、专利权人数量，而其他2个指标的影响效果并不明显。1.数据来源与指标选

目录信息的概念与性质：信息系统的概念系统：信息系统：信息系统的发展：需求：管理信息系统的概念管理信息系统与环境：管理信息系统的技术基础数据处理：数据组织：数据库技术计算机网络技术物联网技术区块链管理信息系统的战略规划和开发方法战略规划的作用、内容和步骤MIS战略规划方法MIS开发方法管理信息系统的系统分析可行性分析管理信息系统的系统设计管理信息系统的系统实施物理系统的实施计算机系统的实施网络系统的实施程序设计程序和系统调试信息的概念与性质：信息是客观世界各种事物特征的反应信息是可以通讯的信息经过加工

ProblemAnalysis ProcessFirst of all, to avoid the judgment of the head, create a newHead, newHead. Since the head may be updated in the insertion sort, every time the head is removed, use newIndex = newhead.nextCreate two pointers and record the header

ProblemAnalysis ProcessThe question is known as the Dutch National Flag problemWe use three Pointers (p0, p2, and curr) to track the right-most boundary of 0, the left-most boundary of 2, and the currently considered element, respectivelyThe idea of t

ProblemAnalysis Process1.Preprocess the given wordList to find all the universal states and record the universal states in the dictionary, the key is the universal state, and the value is all the words with the universal stateuniversal state:Replace a

ProblemAnalysis ProcessAfter the binary tree is expanded into a single linked list, the order of nodes in the single linked list is the order of nodes traversed and visited before the binary tree.Therefore, the binary tree can be preordered traversal to

ProblemAnalysis ProcessThe most intuitive approach is BFS, which traverses the tree layer by layer.The default order of BFS at each layer is from left to right, so the BFS algorithm needs to be adjusted to generate the sawtooth sequenceThe key is to u

ProblemAnalysis ProcessBoth trees are mirror images of each other if the following conditions are metBoth of their roots have the same valueThe right subtree of each tree is mirrored to the left subtree of the other treeWe can achieve such a recursiv

problemAnalysisi ProcessNotice in the explanation of the title that no O at any boundary is filled with X and we can imagine that all O that is not surrounded is directly or indirectly connected to O at the boundary and we can use this property to deter

ProblemAnalysis Process1.Iterate over the letter corresponding to the first number2.A new letter is added to each number3.Adds the combined letters to the result set code until the numeric string is emptyas shown in the figureCodegolangfunc backt

ProblemAnalysis ProcessHow many options do we have when we do the first step? Take “25525511135” for examplepick “2” for the first segmentpick “25” for the first segmentpick “255” for the first segmentThere are three options. After you make your cho

ProblemAnalysis ProcessBFS1.To start with, we take all the rotten oranges, and we queue them up as nodes at level 02.Then BFS is carried out. The adjacent nodes of each node may be nodes in four directions, top, bottom, left and right. Pay attention t

ProblemAnalysis ProcessIn a given sequence traversal array, the number in each subtree must be continuous in the array, so the number contained in the subtree can be determined through the array subindex range, denoted as [left,right] for the entire mid

ProblemBasicsGraphIn computer science, a graph is defined as a set of vertices paired with a set of edges. The vertices are represented by circles, and the edges are the lines between them. Edges connect a vertex to other vertices.The following are a

ProblemAnalysis ProcessWhen we use a queue for breadth first search, all the nodes with an entry degree of 0 are placed in the queue, they are the first nodes that can be ordered topologically, and the relative order between them is irrelevantIn each s

ProblemBasicsTopological SortingTo perform Topological ordering of a Directed Acyclic Graph (DAG)G, all vertices in G are arranged into a linear sequence, making any pair of vertices u and v in the Graph. If the edge <u,v> E(G), then u appears be