[go: up one dir, main page]

WO2009038271A1 - Procédé de groupement automatique, et procédé et appareil de groupement à trajets multiples dans une communication sans fil l'utilisant - Google Patents

Procédé de groupement automatique, et procédé et appareil de groupement à trajets multiples dans une communication sans fil l'utilisant Download PDF

Info

Publication number
WO2009038271A1
WO2009038271A1 PCT/KR2008/002782 KR2008002782W WO2009038271A1 WO 2009038271 A1 WO2009038271 A1 WO 2009038271A1 KR 2008002782 W KR2008002782 W KR 2008002782W WO 2009038271 A1 WO2009038271 A1 WO 2009038271A1
Authority
WO
WIPO (PCT)
Prior art keywords
clustering
algorithm
clusters
channel parameter
cluster
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/KR2008/002782
Other languages
English (en)
Inventor
Jae Joon Park
Won Sop Kim
Myung Don Kim
Hyun Kyu Chung
Seong-Cheol Kim
Ja-Ho Koo
Namkoo Kang
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Electronics and Telecommunications Research Institute ETRI
Seoul National University Industry Foundation
Original Assignee
Electronics and Telecommunications Research Institute ETRI
Seoul National University Industry Foundation
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Electronics and Telecommunications Research Institute ETRI, Seoul National University Industry Foundation filed Critical Electronics and Telecommunications Research Institute ETRI
Priority to US12/678,545 priority Critical patent/US20100217763A1/en
Publication of WO2009038271A1 publication Critical patent/WO2009038271A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413—MIMO systems
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00—Pattern recognition
    • G06F18/20—Analysing
    • G06F18/23—Clustering techniques
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]

Definitions

  • the present invention relates to an automatic clustering method, and more particularly, to an automatic clustering method using an Average-linkage algorithm and a KPower Means algorithm, and a method and apparatus for multi-path clustering required for a spatial channel modeling in a wireless communication environment.
  • a measurement system to ascertain wireless channel characteristics is a system for measuring characteristics of a multiple-input multiple-output (MIMO) channel.
  • the measurement system analyzes characteristics of radio waves of a frequency band in a next generation wireless communication, and is used for channel modeling that must be performed to use the frequency band.
  • MIMO multiple-input multiple-output
  • a next generation wireless communication system requires a broad bandwidth for high speed wireless data transmission and efficient frequency use. Also, a next generation wireless communication system is designed to measure a wideband spatial channel of 100 MHz, as opposed to a narrowband channel, for channel modeling. Accordingly, a broadband radio frequency (RF) module, high speed analog-to-digital converter (ADC), and baseband signal processing technologies, used for a broadband signal processing, are reflected in the design.
  • RF radio frequency
  • ADC analog-to-digital converter
  • baseband signal processing technologies used for a broadband signal processing
  • FIG. 1 is a diagram illustrating a configuration of a multi-path transceiving system in a wireless communication environment in a conventional art.
  • a channel characteristics analysis device 140 hereinafter, measurement system 140, is designed to sequentially transceive a measurement signal and load measurement signals using an external control personal computer (PC) 150 to support various measurement signals.
  • PC personal computer
  • Four transmitting antennas 110 and eight receiving antennas 120 enabling an MIMO channel to be measured are used for the se- quential transceiving.
  • wireless spatial channel measurement data is stored in an external storage device, and various characteristics of a wireless spatial channel, for example, impulse response, scattering function, power delay profile, and Doppler power spectrum, are analyzed by post-processing.
  • the present invention relates to a multi-path clustering using the data, measured by the measurement system 140, with respect to a wireless spatial channel analysis in the wireless communication environment. Also, an automatic clustering algorithm and standard for multi-path clustering are provided.
  • SDMA space division multiple access
  • An array signal processing method to find an angle of arrival using a signal received in an array antenna includes a Space Alternating Generalized Expectation Maximization (SAGE) algorithm.
  • SAGE Space Alternating Generalized Expectation Maximization
  • a channel parameter may be estimated using an SAGE algorithm, and research on how to perform an SCM based on the estimated channel parameter has been conducted. However, since the channel parameter through an SAGE algorithm has no cluster information indicating a similarity of each multi-path, clustering is required for SCM.
  • Clustering has been performed with the naked eye. However, as an amount of measurement data increases and an amount of required channel parameter information increases, a clustering by a macrography is not efficient.
  • the present invention provides an automatic clustering method which sets an initial cluster centroid using a hierarchical clustering algorithm, and thereby may overcome a performance degradation due to the initial cluster centroid.
  • the present invention also provides a method and apparatus for multi-path clustering for a wireless communication environment by using an automatic clustering method which may overcome a performance degradation due to an initial cluster centroid.
  • an automatic clustering method including: a first step of obtaining an initial cluster centroid using a hierarchical clustering algorithm; a second step of moving the initial cluster centroid using a two dimensional clustering algorithm; a third step of clustering a data set according to the moved initial cluster centroid; and a fourth step of calculating a validation index with respect to the clustered data set and determining an optimal number of clusters.
  • the fourth step includes: performing the first step, second step, and third step with respect to each value from an initial value to a maximum value of a previously set number of clusters and obtaining each of the clustered data sets; calculating a validation index with respect to each of the clustered data sets; and determining a number of clusters when the validation index is maximum as an optimal number of clusters.
  • a method of multi- path clustering in a wireless communication environment including: determining a weight of a channel parameter for a distance calculation of a multi-path component; applying the determined weight of the channel parameter to a hierarchical clustering algorithm; calculating a centroid of a cluster using the hierarchical clustering algorithm; setting the calculated centroid of the cluster as an initial cluster centroid and executing a KPowerMeans algorithm; calculating a validation index with respect to a result of the executing; and determining an optimal number of clusters according to the calculated validation index.
  • an apparatus for multi-path clustering in a wireless communication environment including: a data storage unit to store a multi-path component, channel parameter, and weight information about the channel parameter which are received via a multi-path; a clustering algorithm execution unit to apply a hierarchical clustering algorithm with respect to the multi-path component, set an initial cluster centroid, move the initial cluster centroid using a KPowerMeans algorithm, and execute a clustering; and a cluster number determination unit to calculate a validation index with respect to the executed clustering, and determine an optimal number of clusters based on the calculated validation index.
  • FIG. 1 is a diagram illustrating a configuration of a multi-path transceiving system in a wireless communication environment in a conventional art
  • FIG. 2 is a block diagram illustrating an apparatus for multi-path clustering according to an embodiment of the present invention
  • FIG. 3 is a flowchart illustrating an automatic clustering method according to an embodiment of the present invention.
  • FIG. 4 is a flowchart illustrating a method of multi-path clustering in a wireless communication environment according to an embodiment of the present invention
  • FIG. 5 is a graph illustrating performances of clustering algorithms according to an angular spread change in a cluster in a wireless communication environment
  • FIG. 6 is a graphs illustrating performances of clustering algorithms according to a change in a delay spread (DS).
  • FIG. 2 is a block diagram illustrating an apparatus for multi-path clustering according to an embodiment of the present invention.
  • the apparatus for multi-path clustering includes a data storage unit 210, a clustering algorithm execution unit 220, and a cluster number determination unit 230.
  • the data storage unit 210 stores a multi-path component (MPC), channel parameter, and weight information about the channel parameter which are received via a multi-path.
  • the clustering algorithm execution unit 220 applies a hierarchical clustering algorithm with respect to the MPC, sets an initial cluster centroid, moves the initial cluster centroid using a KPowerMeans algorithm, and executes a clustering.
  • the cluster number determination unit 230 calculates a validation index with respect to the executed clustering, and determines an optimal number of clusters based on the calculated validation index.
  • the data storage unit 210 stores the weight of the channel parameter and various measurement data.
  • the measurement data is measured by a multiple-input multiple output (MIMO) system illustrated in FIG. 1.
  • MIMO multiple-input multiple output
  • the weight of the channel parameter is determined according to an experiment which is described in the present specification.
  • the weight of the channel parameter has a delay scaling factor of 10 and an angular scaling factor of 0.5 when a delay, angle of arrival, and angle of departure are used as the channel parameter.
  • the weight of the channel parameter has a delay scaling factor of 10 and an angular scaling factor of 0.7 when delay and angle of departure are used as the channel parameter.
  • the clustering algorithm execution unit 220 performs an automatic clustering algorithm where an Average-linkage algorithm and KPowerMeans algorithm are combined, and executes a clustering with respect to MPCs.
  • K initial number of clusters
  • K max maximum number of clusters
  • CH Calinski-Harabasz
  • FIG. 3 is a flowchart illustrating an automatic clustering method according to an embodiment of the present invention.
  • the automatic clustering method includes obtaining an initial cluster centroid using a hierarchical clustering algorithm in operation S310, moving the initial cluster centroid using a two dimensional clustering algorithm and clustering a data set according to the moved initial cluster centroid in operation S320, calculating a validation index with respect to the clustered data set in operation S330, and determining an optimal number of clusters in operations S340 and S350.
  • the clustering algorithm execution unit 220 calculates the initial cluster centroid of the two dimensional clustering algorithm such as a KPowerMeans algorithm, using the hierarchical clustering algorithm such as an Average-linkage algorithm.
  • the clustering algorithm execution unit 220 performs the two dimensional clustering algorithm and moves the initial cluster centroid. Input data is included in each cluster having the moved initial cluster centroid according to the executing of the two dimensional clustering algorithm.
  • the cluster number determination unit 230 calculates the validation index with respect to a result of the executing. For example, a CH index is used as the validation index.
  • the cluster number determination unit 230 stores the CH index, and determines whether the obtaining in operation S310, the moving in operation S320, and the calculating in operation S330 are performed with respect to every available number of clusters.
  • an optimal automatic clustering method in a wireless communication environment is provided based on a result of comparing a single-linkage, average-linkage, K-means, KPowerMeans, and fuzzy c-means (FCM) clustering algorithms with other clustering validation techniques in order to overcome a disadvantage of clustering using macrography and provide a method of multi-path clustering for a wireless communication environment.
  • An analysis of clustering algorithm performance is based on data provided by a 3 rd generation partnership project (3GPP) spatial channel modeling (SCM).
  • 3GPP 3 rd generation partnership project
  • a number of clusters and information about a path in a cluster may be previously ascertained using the data, and thus a weight of delay and angle of arrival of a multi-path component distance (MCD) may be determined.
  • MCD is a distance function of clustering algorithm.
  • an optimal automatic clustering method in a wireless communication environment is provided based on a result of executing a clustering with respect to various delay spreads (DSs) and 3GPP SCM data of angular spread.
  • DSs delay spreads
  • 3GPP SCM data of angular spread a single-linkage, average-linkage, K-means, KPowerMeans, and FCM clustering algorithm and a CH, Davies-Bouldin (DB), Index I, Combined- Validate (CV), Xie-Beni (XB), and Dunn's index clustering validation techniques are used.
  • a disadvantage associated with the initial cluster centroid is overcome through the average-linkage algorithm which may quickly perform calculations.
  • each MPC is serially combined from an initial cluster, and thus adjacent clusters may be recognized as a single cluster.
  • a centroid is repeatedly updated, and thus clustering is performed based on a cluster centroid, and the disadvantage of the average-linkage algorithm may be overcome.
  • FIG. 4 is a flowchart illustrating a method of multi-path clustering in a wireless communication environment according to an embodiment of the present invention.
  • the method of multi-path clustering includes determining a weight of a channel parameter for a distance calculation of a multi-path component in operation S410, applying the determined weight of the channel parameter to a hierarchical clustering algorithm such as an Average-linkage algorithm in operation S420, calculating a centroid of a cluster using the hierarchical clustering algorithm in operation S430, setting the calculated centroid of the cluster as an initial cluster centroid of a two dimensional clustering such as a KPowerMeans algorithm and executing the KPowerMeans algorithm in operation S440, calculating a validation index with respect to a result of the executing in operation S450, determining whether the above operations in operations S410 through S450 are performed with respect to an available number of clusters in operation S460, and determining an optimal number of clusters according to the calculated validation index in operation S470.
  • a hierarchical clustering algorithm such as an Average-linkage algorithm in operation S420
  • calculating a centroid of a cluster using the hierarchical clustering algorithm in operation S430 setting the
  • a single window datum includes an L number of MPCs.
  • Each MPC includes a vector indicating power
  • the parameter vector Xi includes a delay ⁇ , azimuth AoA ⁇ AoA , elevation AoA
  • the MCD is a distance function enabling path information having different units to be jointly processed.
  • Equation 1 i and j of Equation 1, Equation 2, and Equation 3 are indexes of MPC, respectively.
  • the delay is a most significant factor when performing a clustering. Since various angular spreads occur according to a communication environment, an appropriate weight of the MCD, that is, the weight of the channel parameter, is required to be determined to apply a clustering algorithm.
  • MIMO multiple-input multiple-output
  • a data set provided by the 3GPP SCM has a same delay in each cluster and a predetermined angular spread in each of the clusters.
  • the Average-linkage algorithm is the hierarchical clustering algorithm, and defines a distance between two clusters as an average distance among samples in each cluster.
  • a hierarchical clustering is an operation for forming a large group including a number of small groups of data. Each data sample at a root forms a single cluster. Accordingly, the single cluster is clustered into two groups by the distance calculation among the samples through the Average-linkage algorithm when a number of clusters is two.
  • the initial cluster centroid of the KPowerMeans algorithm is determined using the Average-linkage algorithm.
  • the number of initial clusters is two, and a centroid of each of the two clusters clustered by the Average-linkage algorithm is calculated by, [83] [Equation 5]
  • each of the centroids of the two clusters calculated by Equation 5 is set as the initial cluster centroid, and the KPowerMeans algorithm is executed.
  • the KPowerMeans algorithm performs a clustering according to a number of provided clusters.
  • a K- Means algorithm two dimensionally performs the clustering without considering a hierarchy of clusters.
  • the K-Means algorithm partitions a provided data set according to a predetermined number of clusters.
  • the number of clusters, K is inputted and the K is referred to as a seed point.
  • the seed point is arbitrarily selected from MPCs of an entire data set, and the selected MPC is the initial cluster centroid.
  • Each of the selected MPCs belongs to a cluster having a cluster centroid closest to each of the selected MPCs.
  • the K-Means algorithm is iteratively performed so that an entire sum of distances between each of the cluster centroids and the MPC belonging to each of the clusters is minimal.
  • the entire sum is defined as,
  • L is a number of MPCs
  • X 1 is a parameter vector of a first MPC
  • Cxi is a parameter of a cluster centroid closest to the first MPC.
  • the cluster centroid is moved to an intermediate value of the MPC while iterating through the K-Means algorithm, and the clustering is performed with respect to the again moved cluster centroid.
  • the K-Means algorithm is repeatedly iterated through until the cluster centroid no longer moves.
  • the KPowerMeans algorithm applies a power weight to an existing K-means algorithm for an efficient clustering in a communication environment.
  • the KPowerMeans algorithm is iteratively performed so that an entire sum of distances between each of the cluster centroids and the MPC belonging to the each of the clusters is minimal considering the power weight.
  • the entire sum considering the power weight is defined as,
  • K K max which is a square root of a number of multi-paths received in a single snapshot.
  • the validation index showing an optimal performance when a variety of clustering algorithms are applied with respect to various 3GPP SCM data is the CH index.
  • a cluster algorithm basically receives a number of clusters, separate from data. [I l l] However, it is critical to ascertain a number of clusters according to the provided data and obtain cluster information of each of the MPCs. Accordingly, the validation index is required to determine the optimal number of clusters.
  • a cluster validation method is mainly defined by two distance functions. [112] The two distance functions are
  • A(C 4 ) which is an intra-cluster distance.
  • the inter-cluster distance indicates a separation of each cluster, and the intra-cluster distance indicates a compactness of MPCs of each of the clusters.
  • the cluster validation method generally obtains the optimal number of clusters having a great separation and a minimum compactness.
  • L k is a number of MPCs belonging to a k ⁇ cluster
  • the CH index is calculated with respect to various numbers of clusters, that is, K values, and then a K value enabling the CH index to be maximum is determined as the optimal number of clusters.
  • the clustering algorithm is represented as,
  • the method of multi-path clustering it- eratively performs operations S410 through S470 with respect to the available numbers of clusters, and thus the optimal number of clusters and information about the MPC in the cluster according to the optimal number of clusters may be ascertained.
  • a spatial channel characteristics analysis may be performed using the optimal number of clusters and the information.
  • a weight of an MCD is determined according to a type of channel parameters to compare performances of clustering algorithms.
  • the channel parameter includes a data file.
  • a clustering with respect to various DSs and 3GPP SCM data of angular spread is performed using a single-linkage, average- linkage, K-means, KPowerMeans, and FCM clustering algorithm together with a CH, DB, Index I, CV, XB, and Dunn's index clustering validation techniques.
  • a data set generated by a 3GPP SCM has six clusters and one hundred twenty MPCs belonging to the clusters, which is fixed. Accordingly, a proportion of a number of MPCs belonging to an appropriate cluster from among the one hundred twenty MPCs may be obtained.
  • a simulation with respect to at least one hundred data sets of each of angular spreads and DSs is performed with respect to each of the clustering methods described above.
  • FIG. 5 is a graph illustrating performances of clustering algorithms according to an angular spread change in a cluster in a wireless communication environment.
  • FIG. 6 is a graph illustrating performances of clustering algorithms according to a change in a DS due to a fixed arrival angle spread.
  • an SL refers to a single-linkage algorithm
  • an AL refers to an
  • Average-linkage algorithm, and a FCM P indicates that a power weight is added when calculating a cluster centroid in a FCM algorithm in a conventional art.
  • determining an initial cluster centroid using the SL and AL is superior to a K-means algorithm which arbitrarily determines the initial cluster centroid.
  • the K-means algorithm generates slightly different initial cluster centroids every time the K-means algorithm is performed.
  • the above disadvantage may be overcome when an initial cluster centroid is processed by using a linkage algorithm.
  • a clustering algorithm receives a data set as well as information about a number of clusters, K.
  • the number of clusters with respect to the data set may not be previously determined, and thus a validation technique is required to obtain an optimal number of clusters.
  • a simulation to efficiently obtain the optimal number of clusters is performed using various clustering validation techniques and algorithms. Performances with respect to various angular spreads and DSs in a cluster are compared with the simulation implemented above.
  • Table 1 illustrates only the proportion when the six clusters are accurately obtained.
  • the data set generated by the 3GPP SCM may obtain five or seven clusters, since a delay may be grouped together, angular spread in a cluster may significantly spread, or angular spread distribution between clusters may overlap.
  • Table 2 illustrates an average and a standard deviation obtained using the optimal number of clusters with respect to a KPowerMeans + CH index. When the six clusters are not accurately obtained, similar values may be obtained.
  • An optimal performance is shown in an algorithm according to the present invention in Table 3.
  • a performance difference due to the DS changes is greater than a performance difference due to the angular spread changes in a cluster.
  • the SL since an SL performs a clustering based on a closest MPC among clusters, the SL is most sensitive to the angular spread changes and DS changes, and a degradation of the SL is significant.
  • the SL performs a clustering in a way that each MPC is serially combined from an initial cluster, and thus adjacent clusters may be recognized as a single cluster.
  • An AL also has a same disadvantage when the angular spread and DS increase, since the AL has a basic concept of clustering identical to the SL, even though the AL has a different distance measurement method.
  • a centroid is determined according to a number of clusters first received, and is repeatedly updated, and a clustering is performed based on a cluster centroid. Accordingly, the disadvantage of the linkage algorithm may be overcome.
  • the KPowerMeans algorithm of the present invention may overcome the disadvantage of the linkage algorithm and disadvantage of an initial cluster centroid of the K-means algorithm.
  • a performance of the KPowerMeans algorithm of the present invention is improved in comparison to a KPowerMeans algorithm in a conventional art.
  • Table 4 and Table 5 illustrate an average and a standard deviation obtained using the optimal number of clusters with respect to a KPowerMeans + CH index.
  • the above-described embodiment of the present invention may be recorded in computer-readable media including program instructions to implement various operations embodied by a computer.
  • the media may also include, alone or in com- bination with the program instructions, data files, data structures, and the like.
  • the media and program instructions may be those specially designed and constructed for the purposes of the present invention, or they may be of the kind well-known and available to those having skill in the computer software arts.
  • Examples of computer- readable media include magnetic media such as hard disks, floppy disks, and magnetic tape; optical media such as CD ROM disks and DVD; magneto-optical media such as optical disks; and hardware devices that are specially configured to store and perform program instructions, such as read-only memory (ROM), random access memory (RAM), flash memory, and the like.
  • Examples of program instructions include both machine code, such as produced by a compiler, and files containing higher level code that may be executed by the computer using an interpreter.
  • the described hardware devices may be configured to act as one or more software modules in order to perform the operations of the above-described embodiments of the present invention.
  • an initial cluster centroid is set using a hierarchical clustering algorithm, and thus a performance degradation due to the initial cluster centroid may be overcome.
  • a great amount of data may be automatically processed.
  • a method and apparatus for multi-path clustering which is suitable for a wireless communication environment and superior to an existing macrography in terms of accuracy and efficiency through a validation index and optimal MCD weight with respect to various communication environments.
  • a standard for multi-path clustering may be provided, and a spatial channel analysis and research based on a great amount of measurement data in various communication environments may be supported.

Landscapes

  • Engineering & Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Theoretical Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Evolutionary Biology (AREA)
  • Evolutionary Computation (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Artificial Intelligence (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Cette invention se rapporte à un procédé de groupement automatique qui utilise un algorithme de liaison moyenne et un algorithme des K-moyennes, ainsi qu'à un procédé et à un appareil de groupement à trajets multiples requis pour une modélisation spatiale des canaux (SCM) dans un environnement de communication sans fil. Le procédé de groupement automatique comprend : une première étape consistant à obtenir un centroïde de groupe initial en utilisant un algorithme de groupement hiérarchique ; une deuxième étape consistant à déplacer le centroïde de groupe initial en utilisant un algorithme de groupement bidimensionnel ; une troisième étape consistant à grouper un ensemble de données selon le centroïde de groupe initial déplacé ; et une quatrième étape consistant à calculer un indice de validation concernant l'ensemble des données groupées et à déterminer un nombre optimal de groupes.
PCT/KR2008/002782 2007-09-17 2008-05-19 Procédé de groupement automatique, et procédé et appareil de groupement à trajets multiples dans une communication sans fil l'utilisant Ceased WO2009038271A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US12/678,545 US20100217763A1 (en) 2007-09-17 2008-05-19 Method for automatic clustering and method and apparatus for multipath clustering in wireless communication using the same

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
KR1020070094116A KR100930799B1 (ko) 2007-09-17 2007-09-17 자동화된 클러스터링 방법 및 이를 이용한 이동통신환경에서 다중 경로의 클러스터링 방법 및 장치
KR10-2007-0094116 2007-09-17

Publications (1)

Publication Number Publication Date
WO2009038271A1 true WO2009038271A1 (fr) 2009-03-26

Family

ID=40468062

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2008/002782 Ceased WO2009038271A1 (fr) 2007-09-17 2008-05-19 Procédé de groupement automatique, et procédé et appareil de groupement à trajets multiples dans une communication sans fil l'utilisant

Country Status (3)

Country Link
US (1) US20100217763A1 (fr)
KR (1) KR100930799B1 (fr)
WO (1) WO2009038271A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103324705A (zh) * 2013-06-17 2013-09-25 中国科学院深圳先进技术研究院 大规模向量场数据处理方法
WO2016061911A1 (fr) * 2014-10-20 2016-04-28 浪潮电子信息产业股份有限公司 Procédé et dispositif de mise en œuvre d'un algorithme de regroupement basé sur mic

Families Citing this family (36)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP5423676B2 (ja) 2008-07-30 2014-02-19 日本電気株式会社 データ分類システム、データ分類方法、及びデータ分類プログラム
JP5500070B2 (ja) * 2008-07-30 2014-05-21 日本電気株式会社 データ分類システム、データ分類方法、及びデータ分類プログラム
JP2010255093A (ja) 2009-04-23 2010-11-11 Korea Advanced Inst Of Science & Technol 単結晶ツインフリー貴金属ナノワイヤ及びハロゲン化貴金属を利用した単結晶ツインフリー貴金属ナノワイヤの製造方法
US8175851B1 (en) * 2009-09-24 2012-05-08 L-3 Services, Inc. Using statistical learning methods to fuse parameter estimates
KR101113006B1 (ko) * 2010-02-22 2012-02-24 숭실대학교산학협력단 클러스터 간 상호정보를 이용한 클러스터링 장치 및 방법
CN103336770B (zh) * 2012-02-28 2017-03-01 国际商业机器公司 用于标识互补数据对象的方法和系统
KR101700340B1 (ko) * 2012-04-06 2017-01-26 에스케이플래닛 주식회사 대용량 데이터의 클러스터 결과 분석 시스템 및 방법
KR101907551B1 (ko) * 2012-07-05 2018-12-07 삼성전자 주식회사 확률 그래프의 효과적인 그래프 클러스터링 장치 및 방법
US9336302B1 (en) 2012-07-20 2016-05-10 Zuci Realty Llc Insight and algorithmic clustering for automated synthesis
KR101700104B1 (ko) * 2012-09-04 2017-02-13 에스케이플래닛 주식회사 군집 분석 지원 시스템 및 방법과, 이를 지원하는 장치
CN103136355B (zh) * 2013-03-05 2016-01-06 电子科技大学 一种基于自动阈值鱼群算法的文本聚类方法
US20140269296A1 (en) * 2013-03-13 2014-09-18 Cox Communications, Inc. Systems and Methods of Bundled Label Switch Path for Load Splitting
US9450655B2 (en) * 2013-09-27 2016-09-20 Nec Corporation Two-stage precoding and user grouping for large scale multiple-input multiple-output (MIMO) systems
CN103810261A (zh) * 2014-01-26 2014-05-21 西安理工大学 一种基于商空间理论的K-means聚类方法
US10592539B1 (en) 2014-07-11 2020-03-17 Twitter, Inc. Trends in a messaging platform
US10601749B1 (en) * 2014-07-11 2020-03-24 Twitter, Inc. Trends in a messaging platform
CN106899335A (zh) * 2015-12-15 2017-06-27 联芯科技有限公司 大规模mimo阵列的信道降维方法及系统
US10825314B2 (en) * 2016-08-19 2020-11-03 Miku, Inc. Baby monitor
US11205103B2 (en) 2016-12-09 2021-12-21 The Research Foundation for the State University Semisupervised autoencoder for sentiment analysis
US11392825B2 (en) * 2017-01-09 2022-07-19 Samsung Electronics Co., Ltd. Method and algorithm of recursive deep learning quantization for weight bit reduction
US11055318B2 (en) * 2017-08-31 2021-07-06 Intel Corporation Target number of clusters based on internal index Fibonacci search
CN109526021B (zh) * 2018-11-30 2020-10-27 北京交通大学 一种高速铁路无线信道场景的分类方法及识别方法
CN109861776A (zh) * 2019-01-23 2019-06-07 河海大学 一种模拟多天线室外空间耦合衰落传播特性的方法
US11487964B2 (en) * 2019-03-29 2022-11-01 Dell Products L.P. Comprehensive data science solution for segmentation analysis
CN110460364B (zh) * 2019-06-10 2020-06-26 深圳大学 基于聚类算法的mimo系统的盲多径识别方法及系统
CN112036754B (zh) * 2020-06-30 2022-09-16 上海即科智能技术集团有限公司 基于区块链的金融大数据风控系统
CN112564835B (zh) * 2020-11-26 2022-09-20 华北电力大学 一种基于knn和svm算法的5g无线信道多径分簇计算方法
CN114970649B (zh) * 2021-02-23 2024-07-26 广东精点数据科技股份有限公司 一种基于聚类算法的网络信息处理方法
CN113037344A (zh) * 2021-02-26 2021-06-25 上海师范大学 一种多用户大规模mimo多源图像传输干扰消除方法
CN112926658B (zh) * 2021-02-26 2023-03-21 西安交通大学 基于二维数据嵌入与邻接拓扑图的图像聚类方法及设备
CN113030897B (zh) * 2021-03-10 2022-05-31 森思泰克河北科技有限公司 基于多径的雷达目标聚类方法、装置、设备和存储介质
CN113569950B (zh) * 2021-07-28 2024-05-28 大唐环境产业集团股份有限公司 电站设备故障监测模型生成方法、系统及装置
CN114448531B (zh) * 2021-12-06 2023-05-09 西安电子科技大学 一种信道特性分析方法、系统、介质、设备及处理终端
KR20240070754A (ko) 2022-11-14 2024-05-22 서울대학교산학협력단 Ris를 활용한 무선 통신 시스템에서 기지국의 빔 실패 복구 방법 및 이를 위한 장치와 프로그램
CN116723136B (zh) * 2023-08-09 2023-11-03 南京华飞数据技术有限公司 应用fcm聚类算法的网络检测数据的方法
CN117115491B (zh) * 2023-08-18 2024-04-09 国网山东省电力公司临沂供电公司 一种基于激光点云数据的输电塔杆避雷线保护角的提取方法、系统和存储介质

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030224394A1 (en) * 2002-02-01 2003-12-04 Rosetta Inpharmatics, Llc Computer systems and methods for identifying genes and determining pathways associated with traits
WO2003100557A2 (fr) * 2002-05-20 2003-12-04 Rosetta Inpharmatics Llc Systemes informatiques et procedes pour subdiviser une maladie complexe en maladies composees
US20050055193A1 (en) * 2003-09-05 2005-03-10 Rosetta Inpharmatics Llc Computer systems and methods for analyzing experiment design

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030154181A1 (en) * 2002-01-25 2003-08-14 Nec Usa, Inc. Document clustering with cluster refinement and model selection capabilities
WO2004109447A2 (fr) * 2003-05-30 2004-12-16 Rosetta Inpharmatics Llc Systemes et procedes informatiques permettant d'identifier des marqueurs de substitution

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030224394A1 (en) * 2002-02-01 2003-12-04 Rosetta Inpharmatics, Llc Computer systems and methods for identifying genes and determining pathways associated with traits
WO2003100557A2 (fr) * 2002-05-20 2003-12-04 Rosetta Inpharmatics Llc Systemes informatiques et procedes pour subdiviser une maladie complexe en maladies composees
US20050055193A1 (en) * 2003-09-05 2005-03-10 Rosetta Inpharmatics Llc Computer systems and methods for analyzing experiment design

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
INSOO HWANG: "Two Phase Hierarchical Clustering Algorithm for Group Formation in Data Mining", May 2002 (2002-05-01), XP003024266, Retrieved from the Internet <URL:http://koixra1.kisti.re.kr/ra_resolution.jsp?koi=KISTI1.1003/JNL.JAK0200211921059362> *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103324705A (zh) * 2013-06-17 2013-09-25 中国科学院深圳先进技术研究院 大规模向量场数据处理方法
WO2016061911A1 (fr) * 2014-10-20 2016-04-28 浪潮电子信息产业股份有限公司 Procédé et dispositif de mise en œuvre d'un algorithme de regroupement basé sur mic

Also Published As

Publication number Publication date
KR20090028953A (ko) 2009-03-20
KR100930799B1 (ko) 2009-12-09
US20100217763A1 (en) 2010-08-26

Similar Documents

Publication Publication Date Title
WO2009038271A1 (fr) Procédé de groupement automatique, et procédé et appareil de groupement à trajets multiples dans une communication sans fil l&#39;utilisant
CN108696932B (zh) 一种利用csi多径及机器学习的室外指纹定位方法
CN111867049B (zh) 定位方法、装置及存储介质
Kaemarungsi Efficient design of indoor positioning systems based on location fingerprinting
Zhang et al. A novel CSI-based fingerprinting for localization with a single AP
Lemelson et al. Error estimation for indoor 802.11 location fingerprinting
CN112637950B (zh) 基于角度相似性的指纹定位方法
CN111601358B (zh) 一种多阶段分层分簇空间相关性温度感知数据去冗余方法
CN103501538A (zh) 基于多径能量指纹的室内定位方法
Zhang et al. Utilizing CSI and RSSI to achieve high-precision outdoor positioning: A deep learning approach
CN113037410A (zh) 信道识别方法、装置、传输方法、传输设备、基站、介质
Kia et al. A CNN approach for 5G mm wave positioning using beamformed CSI measurements
CN116601512A (zh) 用于定位的设备和方法
CN111505565B (zh) 一种估计直接路径到达角的方法
CN115643534A (zh) 一种畜禽定位管理方法、系统、电子设备及存储介质
Gao et al. Extreme learning machine ensemble for CSI based device-free indoor localization
Xing et al. HMM-Based CSI Embedding for Trajectory Recovery via Feature Engineering on MIMO-OFDM Channels in LOS/NLOS Regions
CN102088750A (zh) 一种多入多出技术中的传播径分簇方法和装置
WO2023071760A1 (fr) Procédé et appareil de division de domaine de faisceau, support de stockage et dispositif électronique
Moosavi et al. Fingerprinting positioning in distributed massive MIMO systems using affinity propagation clustering and gaussian process regression
Meng et al. Direction-of-arrival estimation based on particle swarm optimization searching approaches for CDMA signals
CN107276702B (zh) 一种认知无线电网络中实时检测多主用户数目的方法
Yu et al. A Novel Wireless Channel Clustering Algorithm Based on Robust Mean-Shift
Naveed et al. Smart indoor Positioning Model for Deterministic Environment
Li et al. Adaptive Sampling for Fingerprinting Localization

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 08753578

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 12678545

Country of ref document: US

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 08753578

Country of ref document: EP

Kind code of ref document: A1