This paper studies the problem of categorical data clustering, especially for transactional data characterized by high dimensionality and large volume. Starting from a heuristic method of increasing the height-to-width ratio of the cluster histogram, we develop a novel algorithm – CLOPE, which is very fast and scalable, while being quite effective. We demonstrate the performance of our algorithm on two real world
標簽： data transactional categorical clustering
上傳時間： 2015-10-24
上傳用戶：evil
The CUBA library provides new implementation of four general-purpose multidimensional integration algorithms: Vegas, Suave, Divonne, and Cuhre. Suave is a new algorithm, Divonne is a known algorithm to which important details have been added, and Vegas and Cuhre are new implementations of existing algorithms with only few improvements over the original versions. All four algorithms can integrate vector integrands and have very similar Fortran, C/C++, and Mathematica interfaces.
標簽： multidimensional general-purpose implementation integration
上傳時間： 2014-09-09
上傳用戶：gxf2016
JPowerGraph is a Java library for creating directed graphs for SWT. It supports graph movement, selection, context menus, tooltips and dynamic edge creation. JPowerGraph has a spring layout algorithm based on that used in TouchGraph.
標簽： JPowerGraph for creating directed
上傳時間： 2013-12-18
上傳用戶：璇珠官人
A one-dimensional calibration object consists of three or more collinear points with known relative positions. It is generally believed that a camera can be calibrated only when a 1D calibration object is in planar motion or rotates around a ¯ xed point. In this paper, it is proved that when a multi-camera is observing a 1D object undergoing general rigid motions synchronously, the camera set can be linearly calibrated. A linear algorithm for the camera set calibration is proposed，and then the linear estimation is further re¯ ned using the maximum likelihood criteria. The simulated and real image experiments show that the proposed algorithm is valid and robust.
標簽： one-dimensional calibration collinear consists
上傳時間： 2014-01-12
上傳用戶：璇珠官人
The functionality is to be designated the corresponding year reign France Thus the year, which was the year of the zodiac. But can be designated a specific date date of the lunar calendar. Author Note : I used to do this as a commercial product development PDA calendar procedures in recent transplant PC, ... software categories : algorithm related paper from the shrimp off FO
標簽： year functionality corresponding designated
上傳時間： 2014-05-28
上傳用戶：chenxichenyue
This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.
標簽： capacities stochastic addresses network
上傳時間： 2015-12-03
上傳用戶：xfbs821
This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.
標簽： capacities stochastic addresses network
上傳時間： 2013-12-25
上傳用戶：ggwz258
This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.
標簽： capacities stochastic addresses network
上傳時間： 2014-01-09
上傳用戶：二驅蚊器
This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.
標簽： capacities stochastic addresses network
上傳時間： 2013-12-28
上傳用戶：獨孤求源
This the implementation of structural SVM for training complex alignment models for protein sequence alignment, especially for homology modeling. The structural SVM algorithm can incorporate many relevant features like secondary structure, relative exposed surface area, profiles and their various interaction into the alignment model. It was developed under Linux and compiles under gcc, built upon the svm^light software by Thorsten Joachims.
標簽： implementation structural for alignment
上傳時間： 2014-01-11
上傳用戶：chenbhdt
