检索结果-内蒙古大学图书馆

Research on Product Reviews Hot Spot Discovery Algorithm Based on Mapreduce

IEEE ACCESS 2020年 8卷 111829-111836页

作者： Su, Hao Liu, Qicheng Mu, Chunxiao Yantai Univ Sch Comp Sci & Control Engn Yantai 264005 Peoples R China

In recent years, with the development of e-commerce, the scale of comment data has shown an exponential growth trend. In this paper, a product review hot spot discovery algorithm based on MapReduce-PR-HD is proposed. The algorithm uses the Vector Space Model to vectorize the text data of the reviews, and utilize the TF-IDF algorithm to calculate the position weight of the feature words, then combines the Canopy algorithm and the K-Means algorithm to achieve the hot spot discovery of product reviews. At the same time, the algorithm obtain the ability to process massive data through the MapReduce framework. Experiments demonstrate that the PR-HD algorithm has high accuracy and parallel efficiency. This allows product developers to obtain more direct and effective suggestions and feedback, which allows product developers to obtain more direct and effective suggestions and feedback.

关键词： Clustering algorithms Data mining partitioning algorithms Mathematical model Indexes Information technology Internet Product reviews hot spot discovery MapReduce canopy algorithm K-means algorithm

来源：评论

学校读者我要写书评

暂无评论

CLOSEST COSET DECODING OF (U)(U + V) CODES

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 1989年第6期7卷 982-988页

作者： HEMMATI, F COMSAT Laboratories Clarksburg MD USA

The general concept of closest coset decoding (CCD) is presented, and a soft-decoding technique for block codes that is based on partitioning a code into a subcode and its cosets is described. The computational complexity of the CCD algorithm is significantly less than that required if a maximum-likelihood detector (MLD) is used. A set-partitioning procedure and details of the CCD algorithm for soft decoding of mod u mod u+v mod codes are presented. Upper bounds on the bit-error-rate (BER) performance of the proposed algorithm are combined, and numerical results and computer simulation tests for the BER performance of second-order Reed-Muller codes of length 16 and 32 are presented. The algorithm is a suboptimum decoding scheme and, in the range of signal-to-noise-power-density ratios of interest, its BER performance is only a few tenths of a dB inferior to the performance of the MLD for the codes examined.< >

关键词： Maximum likelihood decoding Charge coupled devices Bit error rate partitioning algorithms Block codes Computational complexity Maximum likelihood detection Detectors Upper bound Computer simulation

来源：评论

学校读者我要写书评

暂无评论

ITERATIVELY MAXIMUM-LIKELIHOOD DECODABLE SPHERICAL CODES AND A METHOD FOR THEIR CONSTRUCTION

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1988年第3期34卷 480-485页

作者： GAO, JP RUDOLPH, LD HARTMANN, CRP SYRACUSE UNIV SCH COMP & INFORMAT SCISYRACUSENY 13244

The authors propose a class of spherical codes which can be easily decoded by an efficient iterative maximum likelihood decoding algorithm. A necessary and sufficient condition for a spherical code to be iteratively maximum likelihood decodable is formulated. A systematic construction method for such codes based on shrinking of Voronoi corners is analyzed. The base code used for construction is the binary maximal length sequence code. The second-level construction is described. Computer simulation results for selected codes constructed by the proposed method are given.< >

关键词： Iterative decoding Maximum likelihood decoding Iterative algorithms Sufficient conditions Euclidean distance Information science partitioning algorithms Iterative methods Additive white noise Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

Dynamic Beam Scheduling of Multibeam Low Earth Orbit Satellites Based on an Enhanced Artificial Bee Colony Algorithm

引用

IEEE ACCESS 2022年 10卷 115424-115434页

作者： Wei, Debin Zheng, Dongdong Pan, Chengsheng Yang, Li Nanjing Univ Sci & Technol Sch Automat Nanjing 210094 Peoples R China Dalian Univ Commun & Network Lab Dalian 116622 Peoples R China Nanjing Univ Informat Sci & Technol Sch Elect & Informat Engn Nanjing 210044 Peoples R China

The application of beam-hopping technology to low earth orbit satellites can effectively achieve flexible allocation and efficient utilization of on-board resources. Considering that the power resources on low earth orbit satellites are limited, the electromagnetic environment is complex and changeable, and the terminal distribution and service requirements are highly dynamic. We established the service model, service priority model and multibeam resource scheduling model under the constraints of beam bandwidth, on-board power, service priorities, etc. To solve the catastrophic problem of a large solution space in the resource scheduling model and to improve the convergence of the algorithm, we propose an enhanced artificial bee colony algorithm. The optimization strategy improves the process of population initialization, solution updates, and search for the global optimal solution. The simulation results show that under the constraints of cochannel interference and on-board resource utilization, the algorithm always converges to the objective function at the fastest speed, which proves that the algorithm has high applicability to the high dynamic characteristics of LEO satellites. In addition, the algorithm can obtain the global optimal solution, and thus, it can ensure the fairness of resource allocation and the effectiveness of service completion.

关键词： Artificial bee colony algorithm Heuristic algorithms Resource management Dynamic scheduling Low earth orbit satellites Artificial bee colony algorithm partitioning algorithms Satellite communication Satellite communication beam hopping resource scheduling enhanced artificial bee colony algorithm

来源：评论

学校读者我要写书评

暂无评论

HALO - AN EFFICIENT GLOBAL PLACEMENT STRATEGY FOR STANDARD CELLS

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1992年第8期11卷 1024-1031页

作者： YANG, YY KYUNG, CM KOREA ADV INST SCI & TECHNOL DEPT ELECT ENGNSEOUL 131SOUTH KOREA

This paper proposes a new standard cell placement procedure based on an efficient global placement strategy called HALO (hierarchical alternating linear ordering), which generates a global 2-D placement of circuit modules by hiearchical application of linear ordering in alternating direction. The HALO global placement procedure is followed by a detailed placement procedure which consists of row assignment, feed-through cell assignment and intrarow cell assignment steps. Experimental results on two benchmark circuits, primary1 and primary2, consisting of 752 and 2907 cells, have shown decreases of the half-perimeter routing lengths by 7% and 24% respectively, compared with the best available results obtained so far. Total CPU time, including the subsequent detailed placement, was less than half that of earlier work.

关键词： Circuits partitioning algorithms Central Processing Unit Wire Heuristic algorithms Materials science and technology Space technology Routing Packaging

来源：评论

学校读者我要写书评

暂无评论

AN ITERATED ESTIMATION OF THE MOTION PARAMETERS OF A RIGID BODY FROM NOISY DISPLACEMENT VECTORS

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 1990年第11期12卷 1092-1098页

作者： AISBETT, J Electron. Res. Lab. Defence Sci. & Technol. Org. Salisbury SA Australia

Concerns the estimation of the motion parameters of a rigid body from noisy point matches made on perspective views. A minimization problem which permits relatively robust parameter estimation and helps overcome poor zoom estimation when the field-of-view is small is formulated. It is assumed that the motion has a small rotary component, interframe differences are small, and the errors in the system are due to independently distributed errors in the components of the displacement vectors. A fast procedure for minimization is exposited, in which the parameter set is partitioned and conditional generalized least-squares formulas identified. Recursive application of these provides the search space for the minimization problem. Comparative results are presented using simulated data and displacement vectors obtained from an intensity-based matching algorithm.","doi":"10.1109/34.61709","publicationTitle":"IEEE Transactions on Pattern Analysis and Machine Intelligence","startPage":"1092","endPage":"1098","rightsLink":"http://***/AppDispatchServlet?publisherName=ieee&publication=0162-8828&title=An+iterated+estimation+of+the+motion+parameters+of+a+rigid+body+from+noisy+displacement+vectors&isbn=&publicationDate=Nov.+1990&author=J.+Aisbett&ContentID=10.1109/34.61709&orderBeanReset=true&startPage=1092&endPage=1098&volumeNum=12&issueNum=11","displayPublicationTitle":"IEEE Transactions on Pattern Analysis and Machine Intelligence","pdfPath":"/iel5/34/2246/***","keywords":[{"type":"IEEE Keywords","kwd":["Motion estimation","Robustness","Parameter estimation","partitioning algorithms"]},{"type":"INSPEC: Controlled Indexing","kwd":["picture processing","iterative methods","minimisation","noise","parameter estimation","pattern recognition"]},{"type":"INSPEC: Non-Controlled Indexing","kwd":["conditional generalized least-squares formulas","parameter set partitioning","recursive methods","iterated estimation","noisy displacement vectors","motion parameters","no

关键词： Motion estimation Robustness Parameter estimation partitioning algorithms INSPEC: Controlled Indexing picture processing iterative methods minimisation noise parameter estimation pattern recognition INSPEC: Non-Controlled Indexing conditional generalized least-squares formulas parameter set partitioning recursive methods iterated estimation noisy displacement vectors motion parameters noisy point matches perspective views minimization robust parameter estimation rotary component interframe differences independently distributed errors

来源：评论

学校读者我要写书评

暂无评论

TIDY: Publishing a Time Interval Dataset With Differential Privacy

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2021年第5期33卷 2280-2294页

作者： Jung, Woohwan Kwon, Suyong Shim, Kyuseok Seoul Natl Univ Dept Elect & Comp Engn Seoul Gwanak POB 55 Seoul 08755 South Korea

Log data from mobile devices generally contain a series of events with temporal information including time intervals which consist of the start and finish times. However, the problem of releasing differentially private time interval datasets has not been tackled yet. A time interval dataset can be represented by a two dimensional (2D) histogram. Most of the methods to publish 2D histograms partition the data into rectangular spaces to reduce the aggregated noise error for range queries. However, the existing algorithms to publish 2D histograms suffer from the structural error when applied to time interval datasets. To reduce the aggregated noise errors and suppress the increase in the structural error, we propose the TIDY (publishing Time Intervals via Differential privacY) algorithm. We use the frequency vectors as a compact representation of the time interval dataset. After applying the Laplace mechanism to the frequency vectors, we improve the utility of the frequency vectors based on a maximum likelihood estimation. We also develop a new partitioning method adapted for the frequency vectors to balance the trade-off between the noise and structural errors. Our empirical study on real-life and synthetic datasets confirms that TIDY outperforms the existing algorithms for 2D histograms.

关键词： Data privacy Publishing Histograms Privacy Time-frequency analysis Two dimensional displays partitioning algorithms Privacy-preserving data publishing differential privacy time interval dataset

来源：评论

学校读者我要写书评

暂无评论

Sparse Subspace Clustering via Two-Step Reweighted L1-Minimization: Algorithm and Provable Neighbor Recovery Rates

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2021年第2期67卷 1216-1263页

作者： Wu, Jwo-Yuh Huang, Liang-Chi Yang, Ming-Hsun Liu, Chun-Hung Natl Chiao Tung Univ Inst Commun Engn Dept Elect & Comp Engn Hsinchu 30010 Taiwan Natl Chiao Tung Univ Coll Elect Engn Hsinchu 30010 Taiwan Mississippi State Univ Dept Elect & Comp Engn Starkville MS 39762 USA

Sparse subspace clustering (SSC) relies on sparse regression for accurate neighbor identification. Inspired by recent progress in compressive sensing, this paper proposes a new sparse regression scheme for SSC via two-step reweighted l(1)-minimization, which also generalizes a two- step l(1)-minimization algorithm introduced by E. J. Candes et al. in [The Annals of Statistics, vol. 42, no. 2, pp. 669-699, 2014] without incurring extra algorithmic complexity. To fully exploit the prior information offered by the computed sparse representation vector in the first step, our approach places a weight on each component of the regression vector, and solves a weighted LASSO in the second step. We propose a data weighting rule suitable for enhancing neighbor identification accuracy. Then, under the formulation of the dual problem of weighted LASSO, we study in depth the theoretical neighbor recovery rates of the proposed scheme. Specifically, an interesting connection between the locations of nonzeros of the optimal sparse solution to the weighted LASSO and the indexes of the active constraints of the dual problem is established. Afterwards, under the semirandom model, analytic probability lower/upper bounds for various neighbor recovery events are derived. Our analytic results confirm that, with the aid of data weighting and if the prior neighbor information is accurate enough, the proposed scheme with a higher probability can produce many correct neighbors and few incorrect neighbors as compared to the solution without data weighting. Computer simulations are provided to validate our analytic study and evidence the effectiveness of the proposed approach.

关键词： Clustering algorithms Minimization Noise measurement Eigenvalues and eigenfunctions Classification algorithms partitioning algorithms Indexes Subspace clustering sparse representation sparse subspace clustering neighbor recovery discovery rate performance guarantees weighted LASSO compressive sensing

来源：评论

学校读者我要写书评

暂无评论

algorithms for approximate FSM traversal based on state space decomposition

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1996年第12期15卷 1465-1478页

作者： Cho, H Hachtel, GD Macii, E Plessier, B Somenzi, F UNIV COLORADO DEPT ELECT & COMP ENGN BOULDER CO 80309 USA POLITECN TORINO DIPARTIMENTO AUTOMAT & INFORMAT I-10129 TURIN ITALY

This paper presents algorithms for approximate finite state machine traversal based on state space decomposition, The original finite state machine is partitioned in component submachines, and each of them is traversed separately;the result of the computation is an over-estimation of the set of reachable states of the original machine. Different traversal strategies, which reduce the effects of the degrees of freedom introduced by the decomposition, are discussed, Efficient partitioning is a key point for the performance of the traversal techniques;a method to heuristically find a good decomposition of the overall finite state machine, based on the exploration of its state variable dependency graph, is proposed, Applications of the approximate traversal methods to logic optimization of sequential circuits and behavioral verification of finite state machines are described;experimental results for such applications, together with data concerning pure traversal, are reported.

关键词： State-space methods Automata Sequential circuits partitioning algorithms Reachability analysis Explosions Binary decision diagrams Logic devices Optimization methods Information retrieval

来源：评论

学校读者我要写书评

暂无评论

ANALYSIS OF STRATEGIES FOR CONSTRUCTIVE GENERAL BLOCK PLACEMENT

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1988年第3期7卷 371-377页

作者： WIMER, S KOREN, I UNIV MASSACHUSETTS DEPT ELECT & COMP ENGN AMHERST MA 01003 USA IBM CORP ISRAEL SCI CTR HAIFA 32000 ISRAEL NATL SEMICOND ISRAEL CTR DESIGN TEL AVIV ISRAEL

The problem of general block placement in VLSI is considered, using the constructive approach in which blocks are selected and located one at a time. Some well-known strategies are presented for the selection of the next block to be located, novel ones are proposed, and a methodology to evaluate them is established. It is then shown that the optimization problem arising in constructive placement can be reduced to several much simpler sub problems. Objective functions for locating the selected block to achieve a good layout are presented for three different metrics: the squared Euclidean, rectilinear, and Euclidean. Appropriate optimization problems are obtained and solved analytically, using efficient computation schemes. These solutions have been implemented and are used in a real VLSI chip design environment. It is shown that the squared Euclidean and the rectilinear metrics are preferable to the Euclidean one.< >

关键词： Very large scale integration Chip scale packaging partitioning algorithms Humans Computational efficiency Routing Cities and towns Optimization methods Algorithm design and analysis Design automation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：