A kind of single linked lists named aggregative chain is introduced to the algorithm, thus improving the architecture of FP tree. The new FP tree is a one-way tree and only the pointers that point its parent at each n...A kind of single linked lists named aggregative chain is introduced to the algorithm, thus improving the architecture of FP tree. The new FP tree is a one-way tree and only the pointers that point its parent at each node are kept. Route information of different nodes in a same item are compressed into aggregative chains so that the frequent patterns will be produced in aggregative chains without generating node links and conditional pattern bases. An example of Web key words retrieval is given to analyze and verify the frequent pattern algorithm in this paper.展开更多
In this paper, we employ genetic algorithms to solve the migration problem (MP). We propose a new encoding scheme to represent trees, which is composed of two parts: the pre-ordered traversal sequence of tree vertices...In this paper, we employ genetic algorithms to solve the migration problem (MP). We propose a new encoding scheme to represent trees, which is composed of two parts: the pre-ordered traversal sequence of tree vertices and the children number sequence of corresponding tree vertices. The proposed encoding scheme has the advantages of simplicity for encoding and decoding, ease for GA operations, and better equilibrium between exploration and exploitation. It is also adaptive in that, with few restrictions on the length of code, it can be freely lengthened or shortened according to the characteristics of the problem space. Furthermore, the encoding scheme is highly applicable to the degree-constrained minimum spanning tree problem because it also contains the degree information of each node. The simulation results demonstrate the higher performance of our algorithm, with fast convergence to the optima or sub-optima on various problem sizes. Comparing with the binary string encoding of vertices, when the problem size is large, our algorithm runs remarkably faster with comparable search capability. Key words distributed information retrieval - mobile agents - migration problem - genetic algorithms CLC number TP 301. 6 Foundation item: Supported by the National Natural Science Foundation of China (90104005), the Natural Science Foundation of Hubei Province and the Hong Kong Polytechnic University under the grant G-YD63Biography: He Yan-xiang (1952-), male, Professor, research direction: distributed and parallel processing, multi-agent systems, data mining and e-business.展开更多
Ontology is the progression of interpreting the conceptions of the information domain for an assembly of handlers.Familiarizing ontology as information retrieval(IR)aids in augmenting the searching effects of user-req...Ontology is the progression of interpreting the conceptions of the information domain for an assembly of handlers.Familiarizing ontology as information retrieval(IR)aids in augmenting the searching effects of user-required relevant information.The crux of conventional keyword matching-related IR utilizes advanced algorithms for recovering facts from the Internet,mapping the connection between keywords and information,and categorizing the retrieval outcomes.The prevailing procedures for IR consume considerable time,and they could not recover information proficiently.In this study,through applying a modified neuro-fuzzy algorithm(MNFA),the IR time is mitigated,and the retrieval accuracy is enhanced for trouncing the above-stated downsides.The proposed method encompasses three phases:i)development of a crop ontology,ii)implementation of the IR system,and iii)processing of user query.In the initial phase,a crop ontology is developed and evaluated by gathering crop information.In the next phase,a hash tree is constructed using closed frequent patterns(CFPs),and MNFA is used to train the database.In the last phase,for a specified user query,CFP is calculated,and similarity assessment results are retrieved using the database.The performance of the proposed system is measured and compared with that of existing techniques.Experimental results demonstrate that the proposed MNFA has an accuracy of 92.77% for simple queries and 91.45% for complex queries.展开更多
In this paper, we conduct research on the multimedia information retrieval algorithm based on the information restructuring and image reconstruction. With the massive growth of information resources, people through va...In this paper, we conduct research on the multimedia information retrieval algorithm based on the information restructuring and image reconstruction. With the massive growth of information resources, people through various retrieval tools for too much information, led directly to information overload. In vector space model and probability retrieval model based on information retrieval tools rarely consider the user＇ s personalized information needs and features, has resulted in a large amount of information retrieval result and correlation information the user＇ s information demand is not big. In order to improve the existing retrieval system, in recent years, scholars to study looked that context information retrieval context factors need to be considered, such as the retrieval time, place and the interactive history, mission, environment and other factors stated or implied in the retrieval process. At present, the context research has become the information behavior, information search process and the research hotspot in the field of information retrieval interaction.展开更多
Most academic information has its creator, that is, a subject who has created the information. The subject can be an individual, a group, or an institution, and can be a nation depending on the nature of the relevant ...Most academic information has its creator, that is, a subject who has created the information. The subject can be an individual, a group, or an institution, and can be a nation depending on the nature of the relevant information. Most web data are composed of a title, an author, and contents. A paper which is under the academic information category has metadata including a title, an author, keyword, abstract, data about publication, place of publication, ISSN, and the like. A patent has metadata including the title, an applicant, an inventor, an attorney, IPC, number of application, and claims of the invention. Most web-based academic information services enable users to search the information by processing the meta-information. An important element is to search information by using the author field which corresponds to a personal name. This study suggests a method of efficient indexing and using the adjacent operation result ranking algorithm to which phrase search-based boosting elements are applied, and thus improving the accuracy of the search results of author name. This method can be effectively applied to providing accurate search results in the academic information services.展开更多
An improved decision tree method for web information retrieval with self-mapping attributes is proposed.The self-mapping tree has a value of self-mapping attribute in its internal node,and information based on dissimi...An improved decision tree method for web information retrieval with self-mapping attributes is proposed.The self-mapping tree has a value of self-mapping attribute in its internal node,and information based on dissimilarity between a pair of mapping sequences.This method selects self-mapping which exists between data by exhaustive search based on relation and attribute information.Experimental results confirm that the improved method constructs comprehensive and accurate decision tree.Moreover,an example shows that the self-mapping decision tree is promising for data mining and knowledge discovery.展开更多
基于激光雷达(Light Detection And Ranging,LiDAR)数据重建树体三维模型并精准获取林木空间枝干结构参数对林木性状评价、森林动态经营管理与可视化研究具有重要意义。为此提出一种基于骨架细化提取的树木模型重建方法。首先,采用Focus...基于激光雷达(Light Detection And Ranging,LiDAR)数据重建树体三维模型并精准获取林木空间枝干结构参数对林木性状评价、森林动态经营管理与可视化研究具有重要意义。为此提出一种基于骨架细化提取的树木模型重建方法。首先,采用FocusS350/350 PLUS三维激光扫描仪获取3块不同树龄橡胶树的样地数据。然后,作为细化建模的重点,将枝干点云从原始树点中分离出来,再将其过度分割为若干点云簇,通过相邻点云簇判断是否有分枝以及动态确定骨架点间距,并将其运用在空间殖民算法以此来生成树的三维骨架点和骨架点连通性链表,根据连通链表结构自动识别树木中的主枝干和各个一级分枝,再通过广义圆柱体生成树干完成树木三维重建。最后,利用数字孪生技术对这3块不同树龄样地树木进行三维实景建模,使其穿越时空在同一空间中重现,以便更为直观地观察树木在生长过程中的形态变化。该算法得到的橡胶树胸径与实测值比对为,决定系数(R^(2))>0.91,均方根误差(root mean square Error,RMSE)<1.00 cm;主枝干与一级枝干的分枝角为,R^(2)>0.91,RMSE<2.93;一级枝干直径为,R^(2)>0.90,RMSE<1.41 cm;将3个树龄放在一起计算其生长参数,并与实测值进行对比,发现该算法同样适用于异龄林样地的各个生长参数计算。同时发现橡胶树的一级枝条的直径越大,其相对应的叶团簇体积就越大。运用人工智能的理论模型来处理林木的激光点云数据,旨在为森林的可视化以及树木骨架结构的智能化分析与处理等研究领域提供有价值的参考。展开更多
基金Supported by the Natural Science Foundation ofLiaoning Province (20042020)
文摘A kind of single linked lists named aggregative chain is introduced to the algorithm, thus improving the architecture of FP tree. The new FP tree is a one-way tree and only the pointers that point its parent at each node are kept. Route information of different nodes in a same item are compressed into aggregative chains so that the frequent patterns will be produced in aggregative chains without generating node links and conditional pattern bases. An example of Web key words retrieval is given to analyze and verify the frequent pattern algorithm in this paper.
文摘In this paper, we employ genetic algorithms to solve the migration problem (MP). We propose a new encoding scheme to represent trees, which is composed of two parts: the pre-ordered traversal sequence of tree vertices and the children number sequence of corresponding tree vertices. The proposed encoding scheme has the advantages of simplicity for encoding and decoding, ease for GA operations, and better equilibrium between exploration and exploitation. It is also adaptive in that, with few restrictions on the length of code, it can be freely lengthened or shortened according to the characteristics of the problem space. Furthermore, the encoding scheme is highly applicable to the degree-constrained minimum spanning tree problem because it also contains the degree information of each node. The simulation results demonstrate the higher performance of our algorithm, with fast convergence to the optima or sub-optima on various problem sizes. Comparing with the binary string encoding of vertices, when the problem size is large, our algorithm runs remarkably faster with comparable search capability. Key words distributed information retrieval - mobile agents - migration problem - genetic algorithms CLC number TP 301. 6 Foundation item: Supported by the National Natural Science Foundation of China (90104005), the Natural Science Foundation of Hubei Province and the Hong Kong Polytechnic University under the grant G-YD63Biography: He Yan-xiang (1952-), male, Professor, research direction: distributed and parallel processing, multi-agent systems, data mining and e-business.
文摘Ontology is the progression of interpreting the conceptions of the information domain for an assembly of handlers.Familiarizing ontology as information retrieval(IR)aids in augmenting the searching effects of user-required relevant information.The crux of conventional keyword matching-related IR utilizes advanced algorithms for recovering facts from the Internet,mapping the connection between keywords and information,and categorizing the retrieval outcomes.The prevailing procedures for IR consume considerable time,and they could not recover information proficiently.In this study,through applying a modified neuro-fuzzy algorithm(MNFA),the IR time is mitigated,and the retrieval accuracy is enhanced for trouncing the above-stated downsides.The proposed method encompasses three phases:i)development of a crop ontology,ii)implementation of the IR system,and iii)processing of user query.In the initial phase,a crop ontology is developed and evaluated by gathering crop information.In the next phase,a hash tree is constructed using closed frequent patterns(CFPs),and MNFA is used to train the database.In the last phase,for a specified user query,CFP is calculated,and similarity assessment results are retrieved using the database.The performance of the proposed system is measured and compared with that of existing techniques.Experimental results demonstrate that the proposed MNFA has an accuracy of 92.77% for simple queries and 91.45% for complex queries.
文摘In this paper, we conduct research on the multimedia information retrieval algorithm based on the information restructuring and image reconstruction. With the massive growth of information resources, people through various retrieval tools for too much information, led directly to information overload. In vector space model and probability retrieval model based on information retrieval tools rarely consider the user＇ s personalized information needs and features, has resulted in a large amount of information retrieval result and correlation information the user＇ s information demand is not big. In order to improve the existing retrieval system, in recent years, scholars to study looked that context information retrieval context factors need to be considered, such as the retrieval time, place and the interactive history, mission, environment and other factors stated or implied in the retrieval process. At present, the context research has become the information behavior, information search process and the research hotspot in the field of information retrieval interaction.
文摘Most academic information has its creator, that is, a subject who has created the information. The subject can be an individual, a group, or an institution, and can be a nation depending on the nature of the relevant information. Most web data are composed of a title, an author, and contents. A paper which is under the academic information category has metadata including a title, an author, keyword, abstract, data about publication, place of publication, ISSN, and the like. A patent has metadata including the title, an applicant, an inventor, an attorney, IPC, number of application, and claims of the invention. Most web-based academic information services enable users to search the information by processing the meta-information. An important element is to search information by using the author field which corresponds to a personal name. This study suggests a method of efficient indexing and using the adjacent operation result ranking algorithm to which phrase search-based boosting elements are applied, and thus improving the accuracy of the search results of author name. This method can be effectively applied to providing accurate search results in the academic information services.
文摘An improved decision tree method for web information retrieval with self-mapping attributes is proposed.The self-mapping tree has a value of self-mapping attribute in its internal node,and information based on dissimilarity between a pair of mapping sequences.This method selects self-mapping which exists between data by exhaustive search based on relation and attribute information.Experimental results confirm that the improved method constructs comprehensive and accurate decision tree.Moreover,an example shows that the self-mapping decision tree is promising for data mining and knowledge discovery.
文摘基于激光雷达(Light Detection And Ranging,LiDAR)数据重建树体三维模型并精准获取林木空间枝干结构参数对林木性状评价、森林动态经营管理与可视化研究具有重要意义。为此提出一种基于骨架细化提取的树木模型重建方法。首先,采用FocusS350/350 PLUS三维激光扫描仪获取3块不同树龄橡胶树的样地数据。然后,作为细化建模的重点,将枝干点云从原始树点中分离出来,再将其过度分割为若干点云簇,通过相邻点云簇判断是否有分枝以及动态确定骨架点间距,并将其运用在空间殖民算法以此来生成树的三维骨架点和骨架点连通性链表,根据连通链表结构自动识别树木中的主枝干和各个一级分枝,再通过广义圆柱体生成树干完成树木三维重建。最后,利用数字孪生技术对这3块不同树龄样地树木进行三维实景建模,使其穿越时空在同一空间中重现,以便更为直观地观察树木在生长过程中的形态变化。该算法得到的橡胶树胸径与实测值比对为,决定系数(R^(2))>0.91,均方根误差(root mean square Error,RMSE)<1.00 cm;主枝干与一级枝干的分枝角为,R^(2)>0.91,RMSE<2.93;一级枝干直径为,R^(2)>0.90,RMSE<1.41 cm;将3个树龄放在一起计算其生长参数,并与实测值进行对比,发现该算法同样适用于异龄林样地的各个生长参数计算。同时发现橡胶树的一级枝条的直径越大,其相对应的叶团簇体积就越大。运用人工智能的理论模型来处理林木的激光点云数据,旨在为森林的可视化以及树木骨架结构的智能化分析与处理等研究领域提供有价值的参考。
